/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/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:03:49,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:03:49,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:03:49,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:03:49,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:03:49,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:03:49,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:03:49,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:03:49,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:03:49,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:03:49,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:03:49,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:03:49,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:03:49,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:03:49,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:03:49,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:03:49,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:03:49,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:03:49,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:03:49,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:03:49,282 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:03:49,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:03:49,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:03:49,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:03:49,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:03:49,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:03:49,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:03:49,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:03:49,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:03:49,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:03:49,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:03:49,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:03:49,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:03:49,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:03:49,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:03:49,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:03:49,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:03:49,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:03:49,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:03:49,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:03:49,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:03:49,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:03:49,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:03:49,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:03:49,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:03:49,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:03:49,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:03:49,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:03:49,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:03:49,324 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:03:49,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:03:49,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:03:49,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:03:49,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:03:49,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:03:49,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:03:49,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:03:49,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:03:49,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:03:49,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:03:49,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:03:49,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:03:49,327 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:03:49,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:03:49,328 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:03:49,328 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-15 00:03:49,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:03:49,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:03:49,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:03:49,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:03:49,543 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:03:49,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-15 00:03:49,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d90dc14/09ac4c38d22e4555983cdd204d75157d/FLAG02be83981 [2022-04-15 00:03:49,974 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:03:49,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-15 00:03:49,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d90dc14/09ac4c38d22e4555983cdd204d75157d/FLAG02be83981 [2022-04-15 00:03:49,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d90dc14/09ac4c38d22e4555983cdd204d75157d [2022-04-15 00:03:49,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:03:49,998 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:03:50,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:03:50,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:03:50,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:03:50,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:49" (1/1) ... [2022-04-15 00:03:50,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212dcb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50, skipping insertion in model container [2022-04-15 00:03:50,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:49" (1/1) ... [2022-04-15 00:03:50,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:03:50,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:03:50,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c[416,429] [2022-04-15 00:03:50,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:03:50,224 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:03:50,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c[416,429] [2022-04-15 00:03:50,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:03:50,245 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:03:50,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50 WrapperNode [2022-04-15 00:03:50,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:03:50,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:03:50,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:03:50,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:03:50,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:03:50,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:03:50,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:03:50,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:03:50,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:03:50,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:03:50,304 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-15 00:03:50,312 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-15 00:03:50,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:03:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:03:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:03:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:03:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:03:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:03:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:03:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:03:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:03:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:03:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:03:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:03:50,378 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:03:50,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:03:50,486 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:03:50,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:03:50,491 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:03:50,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:50 BoogieIcfgContainer [2022-04-15 00:03:50,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:03:50,493 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:03:50,493 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:03:50,494 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:03:50,496 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,498 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:03:50,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:03:50 BasicIcfg [2022-04-15 00:03:50,516 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:03:50,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:03:50,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:03:50,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:03:50,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:49" (1/4) ... [2022-04-15 00:03:50,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729fd8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:50, skipping insertion in model container [2022-04-15 00:03:50,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50" (2/4) ... [2022-04-15 00:03:50,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729fd8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:50, skipping insertion in model container [2022-04-15 00:03:50,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:50" (3/4) ... [2022-04-15 00:03:50,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729fd8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:03:50, skipping insertion in model container [2022-04-15 00:03:50,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:03:50" (4/4) ... [2022-04-15 00:03:50,521 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.cqvasr [2022-04-15 00:03:50,524 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:03:50,525 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:03:50,555 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:03:50,559 INFO L340 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 [2022-04-15 00:03:50,559 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:03:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:03:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:03:50,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:50,576 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:50,576 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -932305726, now seen corresponding path program 1 times [2022-04-15 00:03:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:50,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440071740] [2022-04-15 00:03:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:50,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:50,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-15 00:03:50,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:03:50,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:03:50,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:50,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-15 00:03:50,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:03:50,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:03:50,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-15 00:03:50,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {27#true} is VALID [2022-04-15 00:03:50,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {27#true} is VALID [2022-04-15 00:03:50,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} [72] L22-2-->L22-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:03:50,755 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [75] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {28#false} is VALID [2022-04-15 00:03:50,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [77] __VERIFIER_assertENTRY-->L10: 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] {28#false} is VALID [2022-04-15 00:03:50,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [79] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:03:50,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-15 00:03:50,756 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-15 00:03:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:50,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440071740] [2022-04-15 00:03:50,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440071740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:03:50,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:03:50,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:03:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290144894] [2022-04-15 00:03:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:03:50,763 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-15 00:03:50,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:50,767 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-15 00:03:50,803 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-15 00:03:50,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:03:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:03:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:03:50,828 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-15 00:03:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:50,934 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-15 00:03:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:03:50,935 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-15 00:03:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:50,936 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-15 00:03:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 00:03:50,942 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-15 00:03:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 00:03:50,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-15 00:03:51,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:51,031 INFO L225 Difference]: With dead ends: 41 [2022-04-15 00:03:51,031 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 00:03:51,033 INFO L912 BasicCegarLoop]: 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-15 00:03:51,036 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:03:51,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:03:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 00:03:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 00:03:51,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:51,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,063 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,063 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,070 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 00:03:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 00:03:51,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:51,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:51,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 00:03:51,071 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 00:03:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,073 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 00:03:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 00:03:51,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:51,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:51,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:51,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 00:03:51,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-15 00:03:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:51,081 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 00:03:51,082 INFO L479 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-15 00:03:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 00:03:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:03:51,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:51,082 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:51,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:03:51,083 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -931382205, now seen corresponding path program 1 times [2022-04-15 00:03:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:51,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229291977] [2022-04-15 00:03:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {159#true} is VALID [2022-04-15 00:03:51,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-15 00:03:51,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-15 00:03:51,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:51,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {159#true} is VALID [2022-04-15 00:03:51,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-15 00:03:51,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-15 00:03:51,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-15 00:03:51,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {159#true} is VALID [2022-04-15 00:03:51,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {164#(and (<= 1 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 00:03:51,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(and (<= 1 main_~n~0) (= main_~i~0 0))} [73] L22-2-->L22-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-15 00:03:51,173 INFO L272 TraceCheckUtils]: 8: Hoare triple {160#false} [75] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {160#false} is VALID [2022-04-15 00:03:51,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {160#false} [77] __VERIFIER_assertENTRY-->L10: 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] {160#false} is VALID [2022-04-15 00:03:51,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {160#false} [79] L10-->L11: 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[] {160#false} is VALID [2022-04-15 00:03:51,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-15 00:03:51,175 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-15 00:03:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:51,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229291977] [2022-04-15 00:03:51,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229291977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:03:51,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:03:51,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:03:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295196041] [2022-04-15 00:03:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:03:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:51,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,188 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-15 00:03:51,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:03:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:03:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:03:51,193 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,319 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 00:03:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:03:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 00:03:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 00:03:51,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 00:03:51,359 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-15 00:03:51,362 INFO L225 Difference]: With dead ends: 33 [2022-04-15 00:03:51,362 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 00:03:51,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:03:51,371 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:03:51,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:03:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 00:03:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-15 00:03:51,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:51,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,384 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,384 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,389 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 00:03:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 00:03:51,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:51,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:51,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:03:51,391 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:03:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,395 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 00:03:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 00:03:51,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:51,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:51,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:51,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:03:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 00:03:51,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-15 00:03:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:51,402 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 00:03:51,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 00:03:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 00:03:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:03:51,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:51,405 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:51,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:03:51,405 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -930428893, now seen corresponding path program 1 times [2022-04-15 00:03:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:51,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995943400] [2022-04-15 00:03:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {300#true} is VALID [2022-04-15 00:03:51,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {300#true} is VALID [2022-04-15 00:03:51,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {300#true} is VALID [2022-04-15 00:03:51,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {300#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:51,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {300#true} is VALID [2022-04-15 00:03:51,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {300#true} is VALID [2022-04-15 00:03:51,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#true} {300#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {300#true} is VALID [2022-04-15 00:03:51,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {300#true} is VALID [2022-04-15 00:03:51,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {305#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 00:03:51,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {305#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 00:03:51,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L22-2-->L25: Formula: (and (< v_main_~i~0_4 v_main_~n~0_5) (= (+ v_main_~x~0_4 (* (- 1) v_main_~y~0_2)) v_main_~x~0_3)) InVars {main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_4} OutVars{main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0] {306#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-15 00:03:51,553 INFO L272 TraceCheckUtils]: 8: Hoare triple {306#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} [76] L25-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {307#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:03:51,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L10: 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] {308#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:03:51,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#(not (= __VERIFIER_assert_~cond 0))} [79] L10-->L11: 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[] {301#false} is VALID [2022-04-15 00:03:51,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {301#false} is VALID [2022-04-15 00:03:51,555 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-15 00:03:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:51,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995943400] [2022-04-15 00:03:51,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995943400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:03:51,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:03:51,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:03:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163355784] [2022-04-15 00:03:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:03:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:51,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,572 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-15 00:03:51,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:03:51,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:51,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:03:51,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:03:51,574 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,801 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 00:03:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:03:51,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 00:03:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 00:03:51,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 00:03:51,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:51,843 INFO L225 Difference]: With dead ends: 30 [2022-04-15 00:03:51,844 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 00:03:51,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:03:51,849 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:03:51,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:03:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 00:03:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-15 00:03:51,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:51,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:03:51,860 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:03:51,860 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:03:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,863 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 00:03:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 00:03:51,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:51,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:51,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-15 00:03:51,868 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-15 00:03:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:51,871 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 00:03:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 00:03:51,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:51,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:51,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:51,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:03:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 00:03:51,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-04-15 00:03:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:51,873 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 00:03:51,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-15 00:03:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 00:03:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 00:03:51,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:51,873 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:51,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:03:51,873 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 231391925, now seen corresponding path program 1 times [2022-04-15 00:03:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:51,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761544721] [2022-04-15 00:03:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {458#true} is VALID [2022-04-15 00:03:51,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 00:03:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:51,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [77] __VERIFIER_assertENTRY-->L10: 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] {458#true} is VALID [2022-04-15 00:03:51,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [80] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [85] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {464#(= main_~x~0 0)} [90] __VERIFIER_assertEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {464#(= main_~x~0 0)} is VALID [2022-04-15 00:03:51,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:51,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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) (= (select |v_#length_1| 2) 20) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {458#true} is VALID [2022-04-15 00:03:51,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [67] mainENTRY-->L21: Formula: (and (= v_main_~i~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~y~0_1 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~i~0, main_~y~0, main_~n~0] {463#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 00:03:51,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L21-->L22-2: Formula: (and (< 0 v_main_~n~0_3) (= v_main_~i~0_2 0)) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~i~0] {463#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 00:03:51,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L22-2-->L25: Formula: (and (< v_main_~i~0_4 v_main_~n~0_5) (= (+ v_main_~x~0_4 (* (- 1) v_main_~y~0_2)) v_main_~x~0_3)) InVars {main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_4} OutVars{main_~i~0=v_main_~i~0_4, main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0] {464#(= main_~x~0 0)} is VALID [2022-04-15 00:03:51,999 INFO L272 TraceCheckUtils]: 8: Hoare triple {464#(= main_~x~0 0)} [76] L25-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {458#true} is VALID [2022-04-15 00:03:51,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} [77] __VERIFIER_assertENTRY-->L10: 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] {458#true} is VALID [2022-04-15 00:03:51,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#true} [80] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:51,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} [85] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:52,000 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {458#true} {464#(= main_~x~0 0)} [90] __VERIFIER_assertEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_9 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {464#(= main_~x~0 0)} is VALID [2022-04-15 00:03:52,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#(= main_~x~0 0)} [78] L25-1-->L27: Formula: (and (= v_main_~y~0_3 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_#t~nondet6, main_~y~0] {464#(= main_~x~0 0)} is VALID [2022-04-15 00:03:52,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {464#(= main_~x~0 0)} [82] L27-->L29: Formula: (and (not (= v_main_~y~0_5 0)) (= v_main_~x~0_6 (+ v_main_~x~0_7 v_main_~y~0_5))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0] {469#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-15 00:03:52,001 INFO L272 TraceCheckUtils]: 15: Hoare triple {469#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} [86] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= v_main_~x~0_10 0)) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {470#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:03:52,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {470#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L10: 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] {471#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:03:52,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#(not (= __VERIFIER_assert_~cond 0))} [79] L10-->L11: 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[] {459#false} is VALID [2022-04-15 00:03:52,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {459#false} [83] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:03:52,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:52,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761544721] [2022-04-15 00:03:52,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761544721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:03:52,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:03:52,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:03:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010222861] [2022-04-15 00:03:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:03:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:03:52,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:52,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:03:52,019 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-15 00:03:52,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:03:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:03:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:03:52,021 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:03:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,285 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 00:03:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:03:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:03:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:03:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-15 00:03:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:03:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-15 00:03:52,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-15 00:03:52,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:52,324 INFO L225 Difference]: With dead ends: 38 [2022-04-15 00:03:52,324 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 00:03:52,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:03:52,325 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:03:52,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:03:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 00:03:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-15 00:03:52,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:52,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:03:52,336 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:03:52,336 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:03:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,337 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 00:03:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 00:03:52,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:52,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:52,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-15 00:03:52,338 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-15 00:03:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,347 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 00:03:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 00:03:52,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:52,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:52,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:52,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:03:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 00:03:52,351 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2022-04-15 00:03:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:52,351 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 00:03:52,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:03:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 00:03:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 00:03:52,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:52,352 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:52,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:03:52,352 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1683544803, now seen corresponding path program 1 times [2022-04-15 00:03:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798018691] [2022-04-15 00:03:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:03:52,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:03:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:03:52,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:03:52,425 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:03:52,426 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:03:52,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 00:03:52,429 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-15 00:03:52,431 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:03:52,445 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:03:52,446 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:03:52,447 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 00:03:52,447 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 00:03:52,447 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 00:03:52,447 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 00:03:52,447 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:03:52,447 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:03:52,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:03:52 BasicIcfg [2022-04-15 00:03:52,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:03:52,448 INFO L158 Benchmark]: Toolchain (without parser) took 2449.89ms. Allocated memory was 167.8MB in the beginning and 235.9MB in the end (delta: 68.2MB). Free memory was 107.2MB in the beginning and 139.7MB in the end (delta: -32.5MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-15 00:03:52,448 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:03:52,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.48ms. Allocated memory was 167.8MB in the beginning and 235.9MB in the end (delta: 68.2MB). Free memory was 107.1MB in the beginning and 207.7MB in the end (delta: -100.6MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-04-15 00:03:52,449 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 235.9MB. Free memory was 207.7MB in the beginning and 206.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:03:52,449 INFO L158 Benchmark]: RCFGBuilder took 222.96ms. Allocated memory is still 235.9MB. Free memory was 206.1MB in the beginning and 194.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:03:52,449 INFO L158 Benchmark]: IcfgTransformer took 22.68ms. Allocated memory is still 235.9MB. Free memory was 194.5MB in the beginning and 193.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:03:52,449 INFO L158 Benchmark]: TraceAbstraction took 1930.21ms. Allocated memory is still 235.9MB. Free memory was 192.5MB in the beginning and 139.7MB in the end (delta: 52.7MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-04-15 00:03:52,450 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.09ms. Allocated memory is still 167.8MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.48ms. Allocated memory was 167.8MB in the beginning and 235.9MB in the end (delta: 68.2MB). Free memory was 107.1MB in the beginning and 207.7MB in the end (delta: -100.6MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 235.9MB. Free memory was 207.7MB in the beginning and 206.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.96ms. Allocated memory is still 235.9MB. Free memory was 206.1MB in the beginning and 194.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.68ms. Allocated memory is still 235.9MB. Free memory was 194.5MB in the beginning and 193.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1930.21ms. Allocated memory is still 235.9MB. Free memory was 192.5MB in the beginning and 139.7MB in the end (delta: 52.7MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int i=0, x=0, y=0; [L20] int n=__VERIFIER_nondet_int(); [L21] COND FALSE !(!(n>0)) [L22] i=0 VAL [i=0, n=1, x=0, y=0] [L22] COND TRUE i