/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-new/gauss_sum.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:46:15,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:46:15,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:46:15,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:46:15,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:46:15,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:46:15,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:46:15,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:46:15,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:46:15,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:46:15,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:46:15,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:46:15,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:46:15,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:46:15,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:46:15,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:46:15,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:46:15,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:46:15,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:46:15,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:46:15,339 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:46:15,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:46:15,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:46:15,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:46:15,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:46:15,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:46:15,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:46:15,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:46:15,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:46:15,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:46:15,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:46:15,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:46:15,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:46:15,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:46:15,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:46:15,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:46:15,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:46:15,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:46:15,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:46:15,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:46:15,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:46:15,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:46:15,359 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:46:15,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:46:15,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:46:15,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:46:15,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:46:15,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:46:15,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:46:15,390 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:46:15,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:46:15,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:46:15,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:46:15,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:46:15,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:46:15,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:46:15,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:46:15,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:46:15,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:46:15,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:46:15,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:46:15,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:46:15,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:46:15,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:46:15,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:46:15,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:46:15,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:46:15,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:46:15,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:46:15,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:46:15,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:46:15,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:46:15,395 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:46:15,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:46:15,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:46:15,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:46:15,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:46:15,635 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:46:15,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-27 21:46:15,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27a1d05b/354299dd263e408d8f3bf49041f5b140/FLAG008eb411c [2022-04-27 21:46:16,080 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:46:16,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-27 21:46:16,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27a1d05b/354299dd263e408d8f3bf49041f5b140/FLAG008eb411c [2022-04-27 21:46:16,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27a1d05b/354299dd263e408d8f3bf49041f5b140 [2022-04-27 21:46:16,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:46:16,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:46:16,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:46:16,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:46:16,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:46:16,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c53a9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16, skipping insertion in model container [2022-04-27 21:46:16,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:46:16,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:46:16,263 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-new/gauss_sum.i[891,904] [2022-04-27 21:46:16,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:46:16,285 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:46:16,294 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-new/gauss_sum.i[891,904] [2022-04-27 21:46:16,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:46:16,307 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:46:16,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16 WrapperNode [2022-04-27 21:46:16,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:46:16,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:46:16,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:46:16,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:46:16,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:46:16,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:46:16,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:46:16,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:46:16,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:46:16,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:16,368 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:46:16,382 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:46:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:46:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:46:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:46:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:46:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:46:16,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:46:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:46:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:46:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:46:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:46:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:46:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:46:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:46:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:46:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:46:16,477 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:46:16,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:46:16,613 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:46:16,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:46:16,619 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:46:16,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:46:16 BoogieIcfgContainer [2022-04-27 21:46:16,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:46:16,621 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:46:16,621 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:46:16,622 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:46:16,625 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:46:16" (1/1) ... [2022-04-27 21:46:16,626 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:46:16,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:46:16 BasicIcfg [2022-04-27 21:46:16,656 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:46:16,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:46:16,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:46:16,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:46:16,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:46:16" (1/4) ... [2022-04-27 21:46:16,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bb61e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:46:16, skipping insertion in model container [2022-04-27 21:46:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:16" (2/4) ... [2022-04-27 21:46:16,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bb61e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:46:16, skipping insertion in model container [2022-04-27 21:46:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:46:16" (3/4) ... [2022-04-27 21:46:16,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bb61e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:46:16, skipping insertion in model container [2022-04-27 21:46:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:46:16" (4/4) ... [2022-04-27 21:46:16,662 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.iqvasr [2022-04-27 21:46:16,690 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:46:16,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:46:16,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:46:16,751 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@a22d664, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18516ea9 [2022-04-27 21:46:16,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:46:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:46:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:46:16,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:16,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:16,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1527693123, now seen corresponding path program 1 times [2022-04-27 21:46:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:16,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099700501] [2022-04-27 21:46:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:16,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:16,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] 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] {24#true} is VALID [2022-04-27 21:46:16,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:46:16,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:46:16,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:16,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] 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] {24#true} is VALID [2022-04-27 21:46:16,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:46:16,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:46:16,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:46:16,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {24#true} is VALID [2022-04-27 21:46:16,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {24#true} is VALID [2022-04-27 21:46:16,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [67] L29-3-->L29-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:46:16,949 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {25#false} is VALID [2022-04-27 21:46:16,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [73] __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] {25#false} is VALID [2022-04-27 21:46:16,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [74] 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[] {25#false} is VALID [2022-04-27 21:46:16,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:46:16,951 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:46:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099700501] [2022-04-27 21:46:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099700501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:46:16,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:46:16,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:46:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520590593] [2022-04-27 21:46:16,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:46:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:46:16,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:16,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:46:16,994 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:46:16,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:46:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:46:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:46:17,035 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 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 2.6666666666666665) internal successors, (8), 2 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:46:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:17,110 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 21:46:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:46:17,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:46:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:46:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:46:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:46:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:46:17,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 21:46:17,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:17,213 INFO L225 Difference]: With dead ends: 33 [2022-04-27 21:46:17,214 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:46:17,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:46:17,219 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:17,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:46:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:46:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:46:17,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:17,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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:46:17,257 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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:46:17,257 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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:46:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:17,259 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:46:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:46:17,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:17,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:17,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-27 21:46:17,261 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-27 21:46:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:17,262 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:46:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:46:17,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:17,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:17,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:17,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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:46:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:46:17,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 21:46:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:17,266 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:46:17,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:46:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:46:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:46:17,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:17,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:17,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:46:17,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1526769602, now seen corresponding path program 1 times [2022-04-27 21:46:17,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:17,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980880694] [2022-04-27 21:46:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:17,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:46:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445509824] [2022-04-27 21:46:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:17,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:17,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:46:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:17,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 21:46:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:17,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:17,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:46:17,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [60] 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] {123#true} is VALID [2022-04-27 21:46:17,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:46:17,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:46:17,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:46:17,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {123#true} is VALID [2022-04-27 21:46:17,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {146#(and (<= 1 main_~n~0) (<= main_~i~0 1))} is VALID [2022-04-27 21:46:17,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#(and (<= 1 main_~n~0) (<= main_~i~0 1))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:46:17,459 INFO L272 TraceCheckUtils]: 8: Hoare triple {124#false} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {124#false} is VALID [2022-04-27 21:46:17,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#false} [73] __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] {124#false} is VALID [2022-04-27 21:46:17,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} [74] 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[] {124#false} is VALID [2022-04-27 21:46:17,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {124#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:46:17,460 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:46:17,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:46:17,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980880694] [2022-04-27 21:46:17,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:46:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445509824] [2022-04-27 21:46:17,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445509824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:46:17,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:46:17,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:46:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165525750] [2022-04-27 21:46:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:46:17,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:17,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,474 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:46:17,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:46:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:46:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:46:17,476 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:17,501 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 21:46:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:46:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 21:46:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 21:46:17,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-04-27 21:46:17,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:17,526 INFO L225 Difference]: With dead ends: 21 [2022-04-27 21:46:17,526 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 21:46:17,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:46:17,528 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:17,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:46:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 21:46:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 21:46:17,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:17,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:46:17,536 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:46:17,536 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:46:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:17,538 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:46:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:46:17,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:17,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:17,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 16 states. [2022-04-27 21:46:17,540 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 16 states. [2022-04-27 21:46:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:17,542 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:46:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:46:17,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:17,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:17,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:17,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:46:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 21:46:17,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 21:46:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:17,550 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 21:46:17,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 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:46:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:46:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:46:17,551 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:17,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:17,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:17,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:17,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1730344036, now seen corresponding path program 1 times [2022-04-27 21:46:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:17,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251761206] [2022-04-27 21:46:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:17,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:46:17,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672841467] [2022-04-27 21:46:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:17,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:17,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:17,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:46:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:17,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 21:46:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:17,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:18,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} [60] 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] {247#true} is VALID [2022-04-27 21:46:18,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {247#true} is VALID [2022-04-27 21:46:18,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {270#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-27 21:46:18,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {274#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-27 21:46:18,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#(and (<= 1 main_~n~0) (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {278#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (<= main_~i~0 2))} is VALID [2022-04-27 21:46:18,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (<= main_~i~0 2))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {282#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (< main_~n~0 2))} is VALID [2022-04-27 21:46:18,168 INFO L272 TraceCheckUtils]: 10: Hoare triple {282#(and (<= 1 main_~n~0) (= (+ (- 1) main_~sum~0) 0) (< main_~n~0 2))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:18,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __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] {290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:18,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {290#(<= 1 __VERIFIER_assert_~cond)} [74] 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[] {248#false} is VALID [2022-04-27 21:46:18,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {248#false} is VALID [2022-04-27 21:46:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:18,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:46:18,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {248#false} is VALID [2022-04-27 21:46:18,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {290#(<= 1 __VERIFIER_assert_~cond)} [74] 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[] {248#false} is VALID [2022-04-27 21:46:18,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __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] {290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:18,387 INFO L272 TraceCheckUtils]: 10: Hoare triple {306#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:18,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {306#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-27 21:46:18,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {310#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 21:46:18,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {318#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {314#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 21:46:18,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {318#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))))} is VALID [2022-04-27 21:46:18,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {247#true} is VALID [2022-04-27 21:46:18,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} [60] 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] {247#true} is VALID [2022-04-27 21:46:18,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {247#true} is VALID [2022-04-27 21:46:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251761206] [2022-04-27 21:46:18,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:46:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672841467] [2022-04-27 21:46:18,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672841467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:46:18,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:46:18,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-27 21:46:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359072306] [2022-04-27 21:46:18,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:46:18,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:46:18,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:18,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:18,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:18,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:46:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:46:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:46:18,412 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:18,554 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 21:46:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:46:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:46:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-27 21:46:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-27 21:46:18,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 22 transitions. [2022-04-27 21:46:18,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:18,577 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:46:18,577 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:46:18,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:46:18,580 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:18,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:46:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:46:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 21:46:18,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:18,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 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:46:18,593 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 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:46:18,593 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 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:46:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:18,596 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 21:46:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 21:46:18,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:18,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:18,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 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) Second operand 17 states. [2022-04-27 21:46:18,597 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 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) Second operand 17 states. [2022-04-27 21:46:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:18,598 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 21:46:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 21:46:18,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:18,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:18,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:18,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 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:46:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-27 21:46:18,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-27 21:46:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:18,601 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-27 21:46:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 21:46:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:46:18,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:18,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:18,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:18,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 21:46:18,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash 203120506, now seen corresponding path program 2 times [2022-04-27 21:46:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685428736] [2022-04-27 21:46:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:18,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:46:18,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506149680] [2022-04-27 21:46:18,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:46:18,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:18,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:18,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 21:46:18,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:46:18,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:46:18,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 21:46:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:18,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:19,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} [60] 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] {439#true} is VALID [2022-04-27 21:46:19,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {439#true} is VALID [2022-04-27 21:46:19,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {439#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {462#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-27 21:46:19,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(and (= main_~sum~0 0) (= main_~i~0 1))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {466#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} is VALID [2022-04-27 21:46:19,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (= (+ (* (- 1) main_~i~0) main_~sum~0) 0) (= main_~i~0 1))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {470#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} is VALID [2022-04-27 21:46:19,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(and (= (+ (- 1) main_~sum~0) 0) (= main_~i~0 2))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {474#(and (= main_~sum~0 (+ main_~i~0 1)) (<= main_~i~0 main_~n~0) (= main_~i~0 2))} is VALID [2022-04-27 21:46:19,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {474#(and (= main_~sum~0 (+ main_~i~0 1)) (<= main_~i~0 main_~n~0) (= main_~i~0 2))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {478#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} is VALID [2022-04-27 21:46:19,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#(and (<= 2 main_~n~0) (= main_~sum~0 3) (<= main_~i~0 3))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {482#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2022-04-27 21:46:19,236 INFO L272 TraceCheckUtils]: 12: Hoare triple {482#(and (< main_~n~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:19,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __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] {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:19,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} [74] 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[] {440#false} is VALID [2022-04-27 21:46:19,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-27 21:46:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:19,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:46:19,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#false} [76] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-27 21:46:19,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} [74] 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[] {440#false} is VALID [2022-04-27 21:46:19,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} [73] __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] {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:19,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {506#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} [70] L29-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~n~0_9 (+ v_main_~n~0_9 1)) (* 2 v_main_~sum~0_6)) 1 0)) InVars {main_~sum~0=v_main_~sum~0_6, main_~n~0=v_main_~n~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0, main_~n~0] {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:19,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [68] L29-3-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {506#(= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2))} is VALID [2022-04-27 21:46:19,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {510#(or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 21:46:19,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {514#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))} is VALID [2022-04-27 21:46:19,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {522#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} [71] L29-2-->L29-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {518#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-27 21:46:19,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {518#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} [69] L29-3-->L29-2: Formula: (and (= (+ v_main_~i~0_3 v_main_~sum~0_4) v_main_~sum~0_3) (<= v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5, main_~sum~0=v_main_~sum~0_3} AuxVars[] AssignedVars[main_~sum~0] {522#(forall ((main_~n~0 Int)) (or (not (<= (+ main_~i~0 1) main_~n~0)) (= (+ 2 (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (<= (+ main_~i~0 2) main_~n~0)))} is VALID [2022-04-27 21:46:19,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {439#true} [65] L27-->L29-3: Formula: (and (<= 1 v_main_~n~0_3) (= 0 v_main_~sum~0_2) (<= v_main_~n~0_3 1000) (= v_main_~i~0_1 1)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~sum~0=v_main_~sum~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {518#(forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0))))} is VALID [2022-04-27 21:46:19,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} [62] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~sum~0, main_~i~0, main_~n~0] {439#true} is VALID [2022-04-27 21:46:19,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} [60] 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] {439#true} is VALID [2022-04-27 21:46:19,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 21:46:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:46:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:19,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685428736] [2022-04-27 21:46:19,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:46:19,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506149680] [2022-04-27 21:46:19,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506149680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:46:19,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:46:19,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2022-04-27 21:46:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432282119] [2022-04-27 21:46:19,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:46:19,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:46:19,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:19,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:19,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:19,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 21:46:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 21:46:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:46:19,968 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:20,412 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 21:46:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 21:46:20,413 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:46:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2022-04-27 21:46:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2022-04-27 21:46:20,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 21 transitions. [2022-04-27 21:46:20,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:20,462 INFO L225 Difference]: With dead ends: 20 [2022-04-27 21:46:20,462 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:46:20,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-27 21:46:20,464 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:20,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-04-27 21:46:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:46:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:46:20,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:20,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:20,465 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:20,465 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:20,465 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:46:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:46:20,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:20,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:20,466 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-27 21:46:20,466 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-27 21:46:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:20,466 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:46:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:46:20,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:20,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:20,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:20,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:46:20,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-27 21:46:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:20,467 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:46:20,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:46:20,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:20,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:46:20,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:20,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:46:20,861 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:46:20,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:46:20,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:46:20,861 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:46:20,861 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:46:20,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:46:20,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:46:20,861 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 34) no Hoare annotation was computed. [2022-04-27 21:46:20,862 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 31) the Hoare annotation is: (and (forall ((main_~n~0 Int)) (or (<= (+ main_~i~0 1) main_~n~0) (= (+ (* main_~i~0 2) (* main_~sum~0 2)) (+ main_~n~0 (* main_~n~0 main_~n~0))) (not (<= main_~i~0 main_~n~0)))) (or (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)))) [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 34) no Hoare annotation was computed. [2022-04-27 21:46:20,862 INFO L895 garLoopResultBuilder]: At program point L29-4(lines 29 31) the Hoare annotation is: (= (+ main_~n~0 (* main_~n~0 main_~n~0)) (* main_~sum~0 2)) [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 21:46:20,862 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:46:20,862 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:46:20,863 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:46:20,863 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:46:20,863 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:46:20,880 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 21:46:20,882 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:46:20,886 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:46:20,918 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 21:46:20,918 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:46:20,918 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:46:20,919 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:46:20,919 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:46:20,919 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 21:46:20,919 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:46:20,919 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:46:20,919 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:46:20,919 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:46:20,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:46:20 BasicIcfg [2022-04-27 21:46:20,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:46:20,932 INFO L158 Benchmark]: Toolchain (without parser) took 4831.73ms. Allocated memory was 197.1MB in the beginning and 255.9MB in the end (delta: 58.7MB). Free memory was 140.9MB in the beginning and 121.0MB in the end (delta: 19.9MB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. [2022-04-27 21:46:20,932 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:46:20,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.66ms. Allocated memory was 197.1MB in the beginning and 255.9MB in the end (delta: 58.7MB). Free memory was 140.8MB in the beginning and 227.6MB in the end (delta: -86.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 21:46:20,932 INFO L158 Benchmark]: Boogie Preprocessor took 24.39ms. Allocated memory is still 255.9MB. Free memory was 227.6MB in the beginning and 226.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:46:20,933 INFO L158 Benchmark]: RCFGBuilder took 287.46ms. Allocated memory is still 255.9MB. Free memory was 226.0MB in the beginning and 214.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:46:20,933 INFO L158 Benchmark]: IcfgTransformer took 34.82ms. Allocated memory is still 255.9MB. Free memory was 214.0MB in the beginning and 212.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:46:20,933 INFO L158 Benchmark]: TraceAbstraction took 4273.35ms. Allocated memory is still 255.9MB. Free memory was 211.9MB in the beginning and 121.0MB in the end (delta: 90.8MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2022-04-27 21:46:20,934 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.11ms. Allocated memory is still 197.1MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.66ms. Allocated memory was 197.1MB in the beginning and 255.9MB in the end (delta: 58.7MB). Free memory was 140.8MB in the beginning and 227.6MB in the end (delta: -86.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.39ms. Allocated memory is still 255.9MB. Free memory was 227.6MB in the beginning and 226.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.46ms. Allocated memory is still 255.9MB. Free memory was 226.0MB in the beginning and 214.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 34.82ms. Allocated memory is still 255.9MB. Free memory was 214.0MB in the beginning and 212.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4273.35ms. Allocated memory is still 255.9MB. Free memory was 211.9MB in the beginning and 121.0MB in the end (delta: 90.8MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,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: 19]: 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 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 51 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 58 HoareAnnotationTreeSize, 11 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 104 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 78 ConstructedInterpolants, 3 QuantifiedInterpolants, 361 SizeOfPredicates, 8 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/10 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: 29]: Loop Invariant [2022-04-27 21:46:20,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2022-04-27 21:46:20,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] Derived loop invariant: (forall main_~n~0 : int :: (i + 1 <= main_~n~0 || i * 2 + sum * 2 == main_~n~0 + main_~n~0 * main_~n~0) || !(i <= main_~n~0)) && (i <= n || n + n * n == sum * 2) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:46:20,961 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...