/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:24:15,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:24:15,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:24:15,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:24:15,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:24:15,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:24:15,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:24:15,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:24:15,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:24:15,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:24:15,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:24:15,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:24:15,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:24:15,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:24:15,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:24:15,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:24:15,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:24:15,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:24:15,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:24:15,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:24:15,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:24:15,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:24:15,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:24:15,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:24:15,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:24:15,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:24:15,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:24:15,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:24:15,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:24:15,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:24:15,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:24:15,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:24:15,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:24:15,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:24:15,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:24:15,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:24:15,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:24:15,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:24:15,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:24:15,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:24:15,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:24:15,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:24:15,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:24:15,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:24:15,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:24:15,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:24:15,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:24:15,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:24:15,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:24:15,640 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:24:15,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:24:15,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:24:15,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:24:15,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:24:15,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:24:15,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:24:15,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:24:15,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:24:15,643 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:24:15,643 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:24:15,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:24:15,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:24:15,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:24:15,839 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:24:15,840 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:24:15,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-27 21:24:15,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131c299ac/784442fdbb8c41e689f05395fda7566f/FLAGf45111913 [2022-04-27 21:24:16,237 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:24:16,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-27 21:24:16,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131c299ac/784442fdbb8c41e689f05395fda7566f/FLAGf45111913 [2022-04-27 21:24:16,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131c299ac/784442fdbb8c41e689f05395fda7566f [2022-04-27 21:24:16,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:24:16,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:24:16,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:24:16,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:24:16,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:24:16,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f20819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16, skipping insertion in model container [2022-04-27 21:24:16,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:24:16,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:24:16,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c[376,389] [2022-04-27 21:24:16,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:24:16,429 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:24:16,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c[376,389] [2022-04-27 21:24:16,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:24:16,451 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:24:16,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16 WrapperNode [2022-04-27 21:24:16,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:24:16,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:24:16,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:24:16,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:24:16,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:24:16,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:24:16,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:24:16,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:24:16,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:24:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:16,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:24:16,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:24:16,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:24:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:24:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:24:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:24:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:24:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:24:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:24:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:24:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:24:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:24:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:24:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:24:16,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:24:16,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:24:16,668 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:24:16,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:24:16,672 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:24:16,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:24:16 BoogieIcfgContainer [2022-04-27 21:24:16,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:24:16,674 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:24:16,674 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:24:16,675 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:24:16,677 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:24:16" (1/1) ... [2022-04-27 21:24:16,678 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:24:16,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:24:16 BasicIcfg [2022-04-27 21:24:16,690 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:24:16,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:24:16,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:24:16,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:24:16,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:24:16" (1/4) ... [2022-04-27 21:24:16,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e88938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:24:16, skipping insertion in model container [2022-04-27 21:24:16,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:24:16" (2/4) ... [2022-04-27 21:24:16,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e88938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:24:16, skipping insertion in model container [2022-04-27 21:24:16,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:24:16" (3/4) ... [2022-04-27 21:24:16,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e88938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:24:16, skipping insertion in model container [2022-04-27 21:24:16,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:24:16" (4/4) ... [2022-04-27 21:24:16,695 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_3-2.cqvasr [2022-04-27 21:24:16,704 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:24:16,704 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:24:16,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:24:16,733 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10671fb0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@205f7c1c [2022-04-27 21:24:16,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:24:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:24:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:24:16,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:16,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:16,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-27 21:24:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:16,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589498410] [2022-04-27 21:24:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:16,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:16,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 21:24:16,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:16,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:16,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:16,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 21:24:16,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:16,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:16,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:24:16,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 0) (= v_main_~N~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~N~0=v_main_~N~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~N~0] {21#true} is VALID [2022-04-27 21:24:16,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L17-2-->L17-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 21:24:16,892 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {22#false} is VALID [2022-04-27 21:24:16,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L7: 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] {22#false} is VALID [2022-04-27 21:24:16,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L7-->L8: 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[] {22#false} is VALID [2022-04-27 21:24:16,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 21:24:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589498410] [2022-04-27 21:24:16,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589498410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:24:16,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:24:16,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:24:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516464418] [2022-04-27 21:24:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:24:16,899 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-27 21:24:16,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:16,914 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-27 21:24:16,942 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-27 21:24:16,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:24:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:16,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:24:16,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:24:16,974 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.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-27 21:24:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,047 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 21:24:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:24:17,047 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-27 21:24:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:17,048 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-27 21:24:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:24:17,053 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-27 21:24:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:24:17,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 21:24:17,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:17,121 INFO L225 Difference]: With dead ends: 29 [2022-04-27 21:24:17,121 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 21:24:17,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:24:17,127 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:17,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:24:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 21:24:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 21:24:17,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:17,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,151 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,152 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,157 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 21:24:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:24:17,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:17,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 21:24:17,161 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 21:24:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,163 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 21:24:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:24:17,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:17,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:17,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 21:24:17,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 21:24:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:17,169 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 21:24:17,170 INFO L496 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-27 21:24:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:24:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:24:17,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:17,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:17,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:24:17,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-27 21:24:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:17,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644514939] [2022-04-27 21:24:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:17,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-27 21:24:17,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:17,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:17,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:17,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-27 21:24:17,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:17,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:17,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-27 21:24:17,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 0) (= v_main_~N~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~N~0=v_main_~N~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~N~0] {115#(= main_~x~0 0)} is VALID [2022-04-27 21:24:17,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} [46] L17-2-->L17-3: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~N~0_2 65536))) InVars {main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} AuxVars[] AssignedVars[] {115#(= main_~x~0 0)} is VALID [2022-04-27 21:24:17,314 INFO L272 TraceCheckUtils]: 7: Hoare triple {115#(= main_~x~0 0)} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:24:17,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L7: 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] {117#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:24:17,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#(not (= __VERIFIER_assert_~cond 0))} [51] L7-->L8: 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[] {111#false} is VALID [2022-04-27 21:24:17,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-27 21:24:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644514939] [2022-04-27 21:24:17,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644514939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:24:17,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:24:17,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:24:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419667697] [2022-04-27 21:24:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:24:17,318 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-27 21:24:17,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:17,318 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-27 21:24:17,328 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-27 21:24:17,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:24:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:17,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:24:17,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:24:17,332 INFO L87 Difference]: Start difference. First operand 12 states and 12 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-27 21:24:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,433 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 21:24:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:24:17,434 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-27 21:24:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:17,434 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-27 21:24:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 21:24:17,437 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-27 21:24:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 21:24:17,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-27 21:24:17,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:17,464 INFO L225 Difference]: With dead ends: 18 [2022-04-27 21:24:17,464 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:24:17,465 INFO L412 NwaCegarLoop]: 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-27 21:24:17,467 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:17,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:24:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:24:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:24:17,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:17,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,472 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,472 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,473 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:24:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:24:17,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:17,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:24:17,474 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:24:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,475 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:24:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:24:17,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:17,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:17,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 21:24:17,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 21:24:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:17,476 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 21:24:17,476 INFO L496 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-27 21:24:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:24:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:24:17,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:24:17,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:24:17,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:24:17,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:24:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:24:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-27 21:24:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:24:17,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362002220] [2022-04-27 21:24:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:24:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:17,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-27 21:24:17,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202#true} {202#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:17,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-27 21:24:17,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 0) (= v_main_~N~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~N~0=v_main_~N~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~N~0] {207#(= main_~x~0 0)} is VALID [2022-04-27 21:24:17,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#(= main_~x~0 0)} [47] L17-2-->L17-2: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (< (mod v_main_~x~0_4 4294967296) (mod v_main_~N~0_3 65536))) InVars {main_~x~0=v_main_~x~0_4, main_~N~0=v_main_~N~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~N~0=v_main_~N~0_3} AuxVars[] AssignedVars[main_~x~0] {208#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} is VALID [2022-04-27 21:24:17,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} [46] L17-2-->L17-3: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~N~0_2 65536))) InVars {main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} AuxVars[] AssignedVars[] {208#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} is VALID [2022-04-27 21:24:17,611 INFO L272 TraceCheckUtils]: 8: Hoare triple {208#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:24:17,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L7: 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] {210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:24:17,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#(not (= __VERIFIER_assert_~cond 0))} [51] L7-->L8: 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[] {203#false} is VALID [2022-04-27 21:24:17,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-27 21:24:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:17,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362002220] [2022-04-27 21:24:17,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362002220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:17,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352648948] [2022-04-27 21:24:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:24:17,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:17,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:24:17,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:24:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:24:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:17,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:24:17,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-27 21:24:17,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 0) (= v_main_~N~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~N~0=v_main_~N~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~N~0] {207#(= main_~x~0 0)} is VALID [2022-04-27 21:24:17,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#(= main_~x~0 0)} [47] L17-2-->L17-2: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (< (mod v_main_~x~0_4 4294967296) (mod v_main_~N~0_3 65536))) InVars {main_~x~0=v_main_~x~0_4, main_~N~0=v_main_~N~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~N~0=v_main_~N~0_3} AuxVars[] AssignedVars[main_~x~0] {233#(= main_~x~0 2)} is VALID [2022-04-27 21:24:17,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= main_~x~0 2)} [46] L17-2-->L17-3: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~N~0_2 65536))) InVars {main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} AuxVars[] AssignedVars[] {233#(= main_~x~0 2)} is VALID [2022-04-27 21:24:17,752 INFO L272 TraceCheckUtils]: 8: Hoare triple {233#(= main_~x~0 2)} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:24:17,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L7: 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] {244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:24:17,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(<= 1 __VERIFIER_assert_~cond)} [51] L7-->L8: 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[] {203#false} is VALID [2022-04-27 21:24:17,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-27 21:24:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:24:17,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:24:17,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-27 21:24:17,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(<= 1 __VERIFIER_assert_~cond)} [51] L7-->L8: 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[] {203#false} is VALID [2022-04-27 21:24:17,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L7: 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] {244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:24:17,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {260#(= (mod main_~x~0 2) 0)} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:24:17,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(= (mod main_~x~0 2) 0)} [46] L17-2-->L17-3: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~N~0_2 65536))) InVars {main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~N~0=v_main_~N~0_2} AuxVars[] AssignedVars[] {260#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:24:17,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= (mod main_~x~0 2) 0)} [47] L17-2-->L17-2: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (< (mod v_main_~x~0_4 4294967296) (mod v_main_~N~0_3 65536))) InVars {main_~x~0=v_main_~x~0_4, main_~N~0=v_main_~N~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~N~0=v_main_~N~0_3} AuxVars[] AssignedVars[main_~x~0] {260#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:24:17,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 0) (= v_main_~N~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~N~0=v_main_~N~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~N~0] {260#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:24:17,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [41] 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_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-27 21:24:17,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-27 21:24:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:24:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352648948] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:24:17,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-27 21:24:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236133352] [2022-04-27 21:24:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:24:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:24:17,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:17,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:17,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:24:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:24:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:24:17,845 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,874 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:24:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:24:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:24:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:24:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-27 21:24:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-27 21:24:17,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2022-04-27 21:24:17,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:17,883 INFO L225 Difference]: With dead ends: 13 [2022-04-27 21:24:17,884 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:24:17,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:24:17,884 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:24:17,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:24:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:24:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:24:17,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:24:17,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:24:17,886 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:24:17,886 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:24:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,886 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:24:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:24:17,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:17,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:24:17,886 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:24:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:24:17,886 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:24:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:24:17,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:24:17,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:24:17,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:24:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:24:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:24:17,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 21:24:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:24:17,887 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:24:17,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:24:17,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:24:17,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:24:17,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:24:18,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:18,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:24:18,151 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:24:18,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:24:18,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:24:18,152 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:24:18,152 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:24:18,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:24:18,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:24:18,152 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 22) the Hoare annotation is: true [2022-04-27 21:24:18,152 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 19) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 21:24:18,152 INFO L895 garLoopResultBuilder]: At program point L17-3(lines 17 19) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 21:24:18,152 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 22) no Hoare annotation was computed. [2022-04-27 21:24:18,152 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 22) no Hoare annotation was computed. [2022-04-27 21:24:18,152 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-27 21:24:18,152 INFO L899 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-27 21:24:18,153 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 21:24:18,153 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-27 21:24:18,153 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-27 21:24:18,153 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-27 21:24:18,155 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 21:24:18,156 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:24:18,170 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:24:18,170 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:24:18,170 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:24:18,171 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:24:18,172 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:24:18,172 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:24:18,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:24:18 BasicIcfg [2022-04-27 21:24:18,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:24:18,180 INFO L158 Benchmark]: Toolchain (without parser) took 1918.87ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 148.9MB in the beginning and 235.2MB in the end (delta: -86.3MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-04-27 21:24:18,180 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:24:18,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.73ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 148.7MB in the beginning and 237.8MB in the end (delta: -89.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-04-27 21:24:18,181 INFO L158 Benchmark]: Boogie Preprocessor took 24.41ms. Allocated memory is still 266.3MB. Free memory was 237.8MB in the beginning and 236.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:24:18,181 INFO L158 Benchmark]: RCFGBuilder took 195.36ms. Allocated memory is still 266.3MB. Free memory was 236.2MB in the beginning and 225.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:24:18,181 INFO L158 Benchmark]: IcfgTransformer took 15.88ms. Allocated memory is still 266.3MB. Free memory was 225.8MB in the beginning and 224.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:24:18,181 INFO L158 Benchmark]: TraceAbstraction took 1486.82ms. Allocated memory is still 266.3MB. Free memory was 224.2MB in the beginning and 235.2MB in the end (delta: -11.0MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2022-04-27 21:24:18,182 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.73ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 148.7MB in the beginning and 237.8MB in the end (delta: -89.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.41ms. Allocated memory is still 266.3MB. Free memory was 237.8MB in the beginning and 236.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 195.36ms. Allocated memory is still 266.3MB. Free memory was 236.2MB in the beginning and 225.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.88ms. Allocated memory is still 266.3MB. Free memory was 225.8MB in the beginning and 224.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1486.82ms. Allocated memory is still 266.3MB. Free memory was 224.2MB in the beginning and 235.2MB in the end (delta: -11.0MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 33 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 21 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 1 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 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: 17]: Loop Invariant Derived loop invariant: x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:24:18,212 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...