/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_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:09:30,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:09:30,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:09:30,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:09:30,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:09:30,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:09:30,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:09:30,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:09:30,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:09:30,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:09:30,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:09:30,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:09:30,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:09:30,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:09:30,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:09:30,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:09:30,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:09:30,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:09:30,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:09:30,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:09:30,296 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:09:30,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:09:30,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:09:30,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:09:30,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:09:30,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:09:30,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:09:30,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:09:30,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:09:30,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:09:30,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:09:30,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:09:30,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:09:30,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:09:30,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:09:30,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:09:30,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:09:30,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:09:30,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:09:30,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:09:30,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:09:30,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:09:30,314 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:09:30,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:09:30,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:09:30,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:09:30,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:09:30,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:09:30,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:09:30,342 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:09:30,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:09:30,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:09:30,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:09:30,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:09:30,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:09:30,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:09:30,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:09:30,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:09:30,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:09:30,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:09:30,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:09:30,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:09:30,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:09:30,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:09:30,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:09:30,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:09:30,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:09:30,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:09:30,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:09:30,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:09:30,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:09:30,346 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:09:30,346 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:09:30,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:09:30,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:09:30,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:09:30,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:09:30,591 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:09:30,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/while_infinite_loop_2.c [2022-04-15 00:09:30,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a792662d/c389b02a1f0845b384ebe91a56050c70/FLAG63554e1c3 [2022-04-15 00:09:31,057 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:09:31,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_2.c [2022-04-15 00:09:31,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a792662d/c389b02a1f0845b384ebe91a56050c70/FLAG63554e1c3 [2022-04-15 00:09:31,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a792662d/c389b02a1f0845b384ebe91a56050c70 [2022-04-15 00:09:31,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:09:31,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:09:31,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:09:31,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:09:31,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:09:31,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127ed9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31, skipping insertion in model container [2022-04-15 00:09:31,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:09:31,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:09:31,235 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_2.c[333,346] [2022-04-15 00:09:31,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:09:31,259 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:09:31,271 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_2.c[333,346] [2022-04-15 00:09:31,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:09:31,284 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:09:31,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31 WrapperNode [2022-04-15 00:09:31,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:09:31,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:09:31,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:09:31,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:09:31,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:09:31,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:09:31,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:09:31,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:09:31,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:09:31,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:09:31,333 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:09:31,338 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:09:31,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:09:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:09:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:09:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:09:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:09:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:09:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:09:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:09:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:09:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:09:31,404 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:09:31,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:09:31,468 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:09:31,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:09:31,473 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:09:31,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:09:31 BoogieIcfgContainer [2022-04-15 00:09:31,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:09:31,476 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:09:31,476 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:09:31,481 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:09:31,483 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:09:31" (1/1) ... [2022-04-15 00:09:31,485 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:09:31,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:09:31 BasicIcfg [2022-04-15 00:09:31,498 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:09:31,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:09:31,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:09:31,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:09:31,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:09:31" (1/4) ... [2022-04-15 00:09:31,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c34bff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:09:31, skipping insertion in model container [2022-04-15 00:09:31,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:09:31" (2/4) ... [2022-04-15 00:09:31,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c34bff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:09:31, skipping insertion in model container [2022-04-15 00:09:31,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:09:31" (3/4) ... [2022-04-15 00:09:31,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c34bff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:09:31, skipping insertion in model container [2022-04-15 00:09:31,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:09:31" (4/4) ... [2022-04-15 00:09:31,504 INFO L111 eAbstractionObserver]: Analyzing ICFG while_infinite_loop_2.cqvasr [2022-04-15 00:09:31,507 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:09:31,507 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:09:31,541 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:09:31,547 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:09:31,547 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:09:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:09:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:09:31,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:09:31,567 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:09:31,567 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:09:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:09:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash 924096770, now seen corresponding path program 1 times [2022-04-15 00:09:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:09:31,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487043295] [2022-04-15 00:09:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:09:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:09:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:09:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:09:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:09:31,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] 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) (= 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] {22#true} is VALID [2022-04-15 00:09:31,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-15 00:09:31,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-15 00:09:31,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:09:31,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] 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) (= 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] {22#true} is VALID [2022-04-15 00:09:31,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-15 00:09:31,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-15 00:09:31,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-15 00:09:31,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [46] mainENTRY-->L16-1: Formula: (= v_main_~x~0_3 0) InVars {} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0] {22#true} is VALID [2022-04-15 00:09:31,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [48] L16-1-->L14-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-15 00:09:31,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [51] L14-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_5 0) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {23#false} is VALID [2022-04-15 00:09:31,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [54] __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] {23#false} is VALID [2022-04-15 00:09:31,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [55] 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[] {23#false} is VALID [2022-04-15 00:09:31,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-15 00:09:31,810 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:09:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:09:31,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487043295] [2022-04-15 00:09:31,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487043295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:09:31,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:09:31,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:09:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999059951] [2022-04-15 00:09:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:09:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 00:09:31,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:09:31,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:09:31,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:09:31,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:09:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:09:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:09:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:09:31,894 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:09:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:31,954 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-04-15 00:09:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:09:31,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 00:09:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:09:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:09:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 00:09:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:09:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 00:09:31,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 00:09:32,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:09:32,040 INFO L225 Difference]: With dead ends: 27 [2022-04-15 00:09:32,040 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 00:09:32,042 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:09:32,045 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:09:32,046 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:09:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 00:09:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 00:09:32,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:09:32,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:09:32,073 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:09:32,073 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:09:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:32,076 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 00:09:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 00:09:32,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:32,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:09:32,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-04-15 00:09:32,077 INFO L87 Difference]: Start difference. First operand has 14 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-04-15 00:09:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:32,079 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 00:09:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 00:09:32,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:32,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:09:32,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:09:32,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:09:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:09:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 00:09:32,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-15 00:09:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:09:32,083 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 00:09:32,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:09:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 00:09:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:09:32,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:09:32,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:09:32,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:09:32,085 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:09:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:09:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 925973603, now seen corresponding path program 1 times [2022-04-15 00:09:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:09:32,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281920457] [2022-04-15 00:09:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:09:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:09:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:09:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:09:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:09:32,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] 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) (= 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] {117#true} is VALID [2022-04-15 00:09:32,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#true} is VALID [2022-04-15 00:09:32,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117#true} {117#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#true} is VALID [2022-04-15 00:09:32,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {117#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:09:32,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] 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) (= 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] {117#true} is VALID [2022-04-15 00:09:32,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#true} is VALID [2022-04-15 00:09:32,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117#true} {117#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#true} is VALID [2022-04-15 00:09:32,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {117#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#true} is VALID [2022-04-15 00:09:32,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#true} [46] mainENTRY-->L16-1: Formula: (= v_main_~x~0_3 0) InVars {} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0] {122#(= main_~x~0 0)} is VALID [2022-04-15 00:09:32,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {122#(= main_~x~0 0)} [50] L16-1-->L16: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(= main_~x~0 0)} is VALID [2022-04-15 00:09:32,196 INFO L272 TraceCheckUtils]: 7: Hoare triple {122#(= main_~x~0 0)} [52] L16-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_4 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {123#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:09:32,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {123#(not (= |__VERIFIER_assert_#in~cond| 0))} [54] __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] {124#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:09:32,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#(not (= __VERIFIER_assert_~cond 0))} [55] 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[] {118#false} is VALID [2022-04-15 00:09:32,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {118#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#false} is VALID [2022-04-15 00:09:32,198 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:09:32,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:09:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281920457] [2022-04-15 00:09:32,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281920457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:09:32,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:09:32,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:09:32,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777665803] [2022-04-15 00:09:32,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:09:32,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 00:09:32,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:09:32,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:09:32,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:09:32,220 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:09:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:09:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:09:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:09:32,222 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:09:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:32,347 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 00:09:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:09:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 00:09:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:09:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:09:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-04-15 00:09:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:09:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-04-15 00:09:32,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 14 transitions. [2022-04-15 00:09:32,369 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-15 00:09:32,369 INFO L225 Difference]: With dead ends: 14 [2022-04-15 00:09:32,369 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:09:32,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:09:32,373 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:09:32,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:09:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:09:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:09:32,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:09:32,374 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-15 00:09:32,375 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-15 00:09:32,375 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-15 00:09:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:32,375 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:09:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:09:32,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:32,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:09:32,376 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-15 00:09:32,376 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-15 00:09:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:09:32,376 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:09:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:09:32,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:32,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:09:32,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:09:32,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:09:32,377 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-15 00:09:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:09:32,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-15 00:09:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:09:32,377 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:09:32,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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:09:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:09:32,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:09:32,380 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:09:32,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:09:32,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:09:32,407 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:09:32,407 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:09:32,408 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:09:32,408 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:09:32,408 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:09:32,408 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:09:32,408 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:09:32,409 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 11 20) the Hoare annotation is: true [2022-04-15 00:09:32,409 INFO L878 garLoopResultBuilder]: At program point L16-1(lines 14 17) the Hoare annotation is: (= main_~x~0 0) [2022-04-15 00:09:32,410 INFO L878 garLoopResultBuilder]: At program point L14-2(lines 14 17) the Hoare annotation is: false [2022-04-15 00:09:32,410 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= main_~x~0 0) [2022-04-15 00:09:32,410 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 11 20) no Hoare annotation was computed. [2022-04-15 00:09:32,411 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 11 20) no Hoare annotation was computed. [2022-04-15 00:09:32,411 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 00:09:32,411 INFO L882 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-15 00:09:32,411 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 00:09:32,412 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:09:32,412 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-15 00:09:32,412 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:09:32,415 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 00:09:32,417 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:09:32,424 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:09:32,424 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:09:32,424 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:09:32,425 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:09:32,426 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:09:32,426 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:09:32,426 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:09:32,426 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:09:32,426 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 00:09:32,427 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:09:32,427 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:09:32,427 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:09:32,428 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:09:32,428 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:09:32,430 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-15 00:09:32,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:09:32 BasicIcfg [2022-04-15 00:09:32,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:09:32,438 INFO L158 Benchmark]: Toolchain (without parser) took 1356.21ms. Allocated memory was 181.4MB in the beginning and 255.9MB in the end (delta: 74.4MB). Free memory was 122.5MB in the beginning and 164.3MB in the end (delta: -41.7MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. [2022-04-15 00:09:32,439 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:09:32,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.74ms. Allocated memory was 181.4MB in the beginning and 255.9MB in the end (delta: 74.4MB). Free memory was 122.3MB in the beginning and 226.5MB in the end (delta: -104.3MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-04-15 00:09:32,440 INFO L158 Benchmark]: Boogie Preprocessor took 20.44ms. Allocated memory is still 255.9MB. Free memory was 226.5MB in the beginning and 225.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:09:32,440 INFO L158 Benchmark]: RCFGBuilder took 168.81ms. Allocated memory is still 255.9MB. Free memory was 225.0MB in the beginning and 215.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 00:09:32,440 INFO L158 Benchmark]: IcfgTransformer took 22.10ms. Allocated memory is still 255.9MB. Free memory was 215.6MB in the beginning and 214.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:09:32,441 INFO L158 Benchmark]: TraceAbstraction took 938.15ms. Allocated memory is still 255.9MB. Free memory was 213.6MB in the beginning and 164.3MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-04-15 00:09:32,443 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.10ms. Allocated memory is still 181.4MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.74ms. Allocated memory was 181.4MB in the beginning and 255.9MB in the end (delta: 74.4MB). Free memory was 122.3MB in the beginning and 226.5MB in the end (delta: -104.3MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.44ms. Allocated memory is still 255.9MB. Free memory was 226.5MB in the beginning and 225.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 168.81ms. Allocated memory is still 255.9MB. Free memory was 225.0MB in the beginning and 215.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 22.10ms. Allocated memory is still 255.9MB. Free memory was 215.6MB in the beginning and 214.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 938.15ms. Allocated memory is still 255.9MB. Free memory was 213.6MB in the beginning and 164.3MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. 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 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 22 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 10 PreInvPairs, 12 NumberOfFragments, 18 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 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 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: x == 0 RESULT: Ultimate proved your program to be correct! [2022-04-15 00:09:32,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...