/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/while_infinite_loop_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:06:24,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:06:24,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:06:24,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:06:24,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:06:24,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:06:24,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:06:24,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:06:24,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:06:24,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:06:24,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:06:24,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:06:24,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:06:24,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:06:24,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:06:24,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:06:24,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:06:24,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:06:24,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:06:24,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:06:24,319 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:06:24,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:06:24,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:06:24,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:06:24,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:06:24,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:06:24,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:06:24,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:06:24,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:06:24,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:06:24,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:06:24,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:06:24,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:06:24,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:06:24,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:06:24,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:06:24,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:06:24,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:06:24,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:06:24,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:06:24,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:06:24,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:06:24,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:06:24,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:06:24,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:06:24,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:06:24,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:06:24,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:06:24,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:06:24,367 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:06:24,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:06:24,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:06:24,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:06:24,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:06:24,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:06:24,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:06:24,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:06:24,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:06:24,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:06:24,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:06:24,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:06:24,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:06:24,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:06:24,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:06:24,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:06:24,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:06:24,374 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-07 22:06:24,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:06:24,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:06:24,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:06:24,608 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:06:24,609 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:06:24,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/while_infinite_loop_3.c [2022-04-07 22:06:24,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e329446f/0c55840becdd4b9bbbd2ebe682f5cd78/FLAG7eed66131 [2022-04-07 22:06:24,980 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:06:24,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_3.c [2022-04-07 22:06:24,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e329446f/0c55840becdd4b9bbbd2ebe682f5cd78/FLAG7eed66131 [2022-04-07 22:06:25,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e329446f/0c55840becdd4b9bbbd2ebe682f5cd78 [2022-04-07 22:06:25,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:06:25,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:06:25,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:06:25,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:06:25,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:06:25,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33624d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25, skipping insertion in model container [2022-04-07 22:06:25,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:06:25,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:06:25,583 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/while_infinite_loop_3.c[333,346] [2022-04-07 22:06:25,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:06:25,606 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:06:25,616 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/while_infinite_loop_3.c[333,346] [2022-04-07 22:06:25,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:06:25,629 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:06:25,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25 WrapperNode [2022-04-07 22:06:25,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:06:25,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:06:25,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:06:25,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:06:25,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:06:25,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:06:25,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:06:25,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:06:25,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:06:25,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:06:25,685 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-07 22:06:25,687 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-07 22:06:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:06:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:06:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:06:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:06:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2022-04-07 22:06:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:06:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:06:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:06:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:06:25,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:06:25,757 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:06:25,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:06:25,831 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:06:25,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:06:25,837 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 22:06:25,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:06:25 BoogieIcfgContainer [2022-04-07 22:06:25,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:06:25,840 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:06:25,840 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:06:25,841 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:06:25,843 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:06:25" (1/1) ... [2022-04-07 22:06:25,845 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:06:25,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:06:25 BasicIcfg [2022-04-07 22:06:25,859 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:06:25,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:06:25,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:06:25,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:06:25,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:06:25" (1/4) ... [2022-04-07 22:06:25,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a99dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:06:25, skipping insertion in model container [2022-04-07 22:06:25,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:06:25" (2/4) ... [2022-04-07 22:06:25,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a99dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:06:25, skipping insertion in model container [2022-04-07 22:06:25,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:06:25" (3/4) ... [2022-04-07 22:06:25,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a99dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:06:25, skipping insertion in model container [2022-04-07 22:06:25,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:06:25" (4/4) ... [2022-04-07 22:06:25,865 INFO L111 eAbstractionObserver]: Analyzing ICFG while_infinite_loop_3.cqvasr [2022-04-07 22:06:25,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:06:25,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:06:25,924 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:06:25,930 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-07 22:06:25,930 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:06:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:06:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-07 22:06:25,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:06:25,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:06:25,966 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:06:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:06:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -459487812, now seen corresponding path program 1 times [2022-04-07 22:06:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:06:25,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837619712] [2022-04-07 22:06:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:06:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:06:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:06:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:06:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:06:26,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 24) (= v_~x~0_5 0) (= 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|, ~x~0=v_~x~0_5, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, ~x~0, #NULL.base] {26#true} is VALID [2022-04-07 22:06:26,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 22:06:26,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 22:06:26,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:06:26,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 24) (= v_~x~0_5 0) (= 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|, ~x~0=v_~x~0_5, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, ~x~0, #NULL.base] {26#true} is VALID [2022-04-07 22:06:26,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 22:06:26,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 22:06:26,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [57] L-1-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 22:06:26,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [60] L29-->L26-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-07 22:06:26,171 INFO L272 TraceCheckUtils]: 6: Hoare triple {27#false} [64] L26-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= v_~x~0_12 0)) 1 0)) InVars {~x~0=v_~x~0_12} OutVars{~x~0=v_~x~0_12, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] {27#false} is VALID [2022-04-07 22:06:26,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} [67] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-07 22:06:26,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [73] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-07 22:06:26,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [76] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-07 22:06:26,172 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-07 22:06:26,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:06:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837619712] [2022-04-07 22:06:26,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837619712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:06:26,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:06:26,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:06:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613062263] [2022-04-07 22:06:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:06:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2022-04-07 22:06:26,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:06:26,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-07 22:06:26,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:06:26,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:06:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:06:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:06:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:06:26,260 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 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.0) internal successors, (6), 2 states have internal predecessors, (6), 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-07 22:06:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:06:26,385 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions. [2022-04-07 22:06:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:06:26,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2022-04-07 22:06:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:06:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-07 22:06:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-07 22:06:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-07 22:06:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-07 22:06:26,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-07 22:06:26,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:06:26,492 INFO L225 Difference]: With dead ends: 37 [2022-04-07 22:06:26,493 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 22:06:26,495 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-07 22:06:26,502 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:06:26,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:06:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 22:06:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-04-07 22:06:26,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:06:26,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:06:26,545 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:06:26,546 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:06:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:06:26,554 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-07 22:06:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-07 22:06:26,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:06:26,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:06:26,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-07 22:06:26,555 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-07 22:06:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:06:26,560 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-07 22:06:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-07 22:06:26,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:06:26,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:06:26,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:06:26,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:06:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:06:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-07 22:06:26,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-04-07 22:06:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:06:26,572 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-07 22:06:26,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-07 22:06:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-07 22:06:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 22:06:26,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:06:26,573 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:06:26,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:06:26,573 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:06:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:06:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2132896698, now seen corresponding path program 1 times [2022-04-07 22:06:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:06:26,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715461849] [2022-04-07 22:06:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:06:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:06:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:06:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:06:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:06:26,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 24) (= v_~x~0_5 0) (= 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|, ~x~0=v_~x~0_5, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, ~x~0, #NULL.base] {150#true} is VALID [2022-04-07 22:06:26,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-07 22:06:26,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150#true} {150#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-07 22:06:26,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 22:06:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:06:26,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(= ~x~0 |old(~x~0)|)} [71] evalENTRY-->L16-1: Formula: (= v_~x~0_6 0) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {158#(= ~x~0 0)} is VALID [2022-04-07 22:06:26,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#(= ~x~0 0)} [75] L16-1-->evalEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#(= ~x~0 0)} is VALID [2022-04-07 22:06:26,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#(= ~x~0 0)} {150#true} [81] evalEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#(= ~x~0 0)} is VALID [2022-04-07 22:06:26,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:06:26,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 24) (= v_~x~0_5 0) (= 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|, ~x~0=v_~x~0_5, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, ~x~0, #NULL.base] {150#true} is VALID [2022-04-07 22:06:26,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-07 22:06:26,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-07 22:06:26,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} [57] L-1-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-07 22:06:26,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} [62] L29-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-07 22:06:26,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {150#true} [65] L28-->evalENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#(= ~x~0 |old(~x~0)|)} is VALID [2022-04-07 22:06:26,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(= ~x~0 |old(~x~0)|)} [71] evalENTRY-->L16-1: Formula: (= v_~x~0_6 0) InVars {} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[~x~0] {158#(= ~x~0 0)} is VALID [2022-04-07 22:06:26,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#(= ~x~0 0)} [75] L16-1-->evalEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#(= ~x~0 0)} is VALID [2022-04-07 22:06:26,748 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {158#(= ~x~0 0)} {150#true} [81] evalEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#(= ~x~0 0)} is VALID [2022-04-07 22:06:26,749 INFO L272 TraceCheckUtils]: 10: Hoare triple {158#(= ~x~0 0)} [68] L28-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_~x~0_11 0) 1 0)) InVars {~x~0=v_~x~0_11} OutVars{~x~0=v_~x~0_11, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] {159#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:06:26,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#(not (= |__VERIFIER_assert_#in~cond| 0))} [67] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {160#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:06:26,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#(not (= __VERIFIER_assert_~cond 0))} [73] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {151#false} is VALID [2022-04-07 22:06:26,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} [76] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#false} is VALID [2022-04-07 22:06:26,750 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-07 22:06:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:06:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715461849] [2022-04-07 22:06:26,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715461849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:06:26,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:06:26,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 22:06:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100089525] [2022-04-07 22:06:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:06:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-07 22:06:26,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:06:26,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 22:06:26,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:06:26,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 22:06:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:06:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 22:06:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:06:26,769 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 22:06:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:06:26,897 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-07 22:06:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:06:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-07 22:06:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:06:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 22:06:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-07 22:06:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 22:06:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-07 22:06:26,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-04-07 22:06:26,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:06:26,925 INFO L225 Difference]: With dead ends: 17 [2022-04-07 22:06:26,925 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:06:26,929 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 22:06:26,931 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:06:26,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:06:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:06:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:06:26,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:06:26,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:06:26,934 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:06:26,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:06:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:06:26,935 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:06:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:06:26,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:06:26,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:06:26,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:06:26,935 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:06:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:06:26,936 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:06:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:06:26,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:06:26,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:06:26,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:06:26,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:06:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:06:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:06:26,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-07 22:06:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:06:26,937 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:06:26,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 22:06:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:06:26,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:06:26,944 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:06:26,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:06:26,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:06:27,018 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:06:27,019 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:06:27,019 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:06:27,020 INFO L878 garLoopResultBuilder]: At program point evalENTRY(lines 14 21) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-07 22:06:27,020 INFO L882 garLoopResultBuilder]: For program point L16-1(lines 14 21) no Hoare annotation was computed. [2022-04-07 22:06:27,020 INFO L882 garLoopResultBuilder]: For program point evalEXIT(lines 14 21) no Hoare annotation was computed. [2022-04-07 22:06:27,020 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:06:27,020 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~x~0 0) [2022-04-07 22:06:27,021 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:06:27,021 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:06:27,022 INFO L878 garLoopResultBuilder]: At program point L29(lines 24 35) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-07 22:06:27,022 INFO L878 garLoopResultBuilder]: At program point L26-1(lines 26 30) the Hoare annotation is: (not (= |old(~x~0)| 0)) [2022-04-07 22:06:27,023 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-07 22:06:27,023 INFO L882 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-07 22:06:27,023 INFO L878 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-07 22:06:27,023 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 35) no Hoare annotation was computed. [2022-04-07 22:06:27,023 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 35) no Hoare annotation was computed. [2022-04-07 22:06:27,024 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-07 22:06:27,024 INFO L882 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-07 22:06:27,024 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-07 22:06:27,024 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-07 22:06:27,025 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-07 22:06:27,025 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-07 22:06:27,028 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-07 22:06:27,030 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:06:27,041 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:06:27,044 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 22:06:27,044 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-07 22:06:27,047 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-07 22:06:27,047 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-07 22:06:27,047 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:06:27,048 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-07 22:06:27,049 WARN L170 areAnnotationChecker]: evalEXIT has no Hoare annotation [2022-04-07 22:06:27,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:06:27,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:06:27,050 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 22:06:27,050 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:06:27,050 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:06:27,050 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:06:27,050 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 22:06:27,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:06:27 BasicIcfg [2022-04-07 22:06:27,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:06:27,052 INFO L158 Benchmark]: Toolchain (without parser) took 1639.45ms. Allocated memory was 187.7MB in the beginning and 307.2MB in the end (delta: 119.5MB). Free memory was 128.5MB in the beginning and 205.4MB in the end (delta: -76.9MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. [2022-04-07 22:06:27,053 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:06:27,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.35ms. Allocated memory was 187.7MB in the beginning and 307.2MB in the end (delta: 119.5MB). Free memory was 128.4MB in the beginning and 278.8MB in the end (delta: -150.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-07 22:06:27,053 INFO L158 Benchmark]: Boogie Preprocessor took 23.20ms. Allocated memory is still 307.2MB. Free memory was 278.8MB in the beginning and 277.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:06:27,054 INFO L158 Benchmark]: RCFGBuilder took 183.53ms. Allocated memory is still 307.2MB. Free memory was 277.2MB in the beginning and 266.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 22:06:27,054 INFO L158 Benchmark]: IcfgTransformer took 19.24ms. Allocated memory is still 307.2MB. Free memory was 266.7MB in the beginning and 265.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:06:27,054 INFO L158 Benchmark]: TraceAbstraction took 1190.85ms. Allocated memory is still 307.2MB. Free memory was 265.1MB in the beginning and 205.4MB in the end (delta: 59.8MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. [2022-04-07 22:06:27,056 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.35ms. Allocated memory was 187.7MB in the beginning and 307.2MB in the end (delta: 119.5MB). Free memory was 128.4MB in the beginning and 278.8MB in the end (delta: -150.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.20ms. Allocated memory is still 307.2MB. Free memory was 278.8MB in the beginning and 277.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 183.53ms. Allocated memory is still 307.2MB. Free memory was 277.2MB in the beginning and 266.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.24ms. Allocated memory is still 307.2MB. Free memory was 266.7MB in the beginning and 265.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1190.85ms. Allocated memory is still 307.2MB. Free memory was 265.1MB in the beginning and 205.4MB in the end (delta: 59.8MB). Peak memory consumption was 59.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 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 29 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 51 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 31 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 22:06:27,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...