/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:17:20,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:17:20,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:17:20,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:17:20,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:17:20,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:17:20,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:17:20,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:17:20,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:17:20,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:17:20,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:17:20,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:17:20,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:17:20,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:17:20,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:17:20,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:17:20,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:17:20,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:17:20,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:17:20,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:17:20,713 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:17:20,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:17:20,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:17:20,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:17:20,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:17:20,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:17:20,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:17:20,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:17:20,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:17:20,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:17:20,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:17:20,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:17:20,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:17:20,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:17:20,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:17:20,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:17:20,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:17:20,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:17:20,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:17:20,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:17:20,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:17:20,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:17:20,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:17:20,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:17:20,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:17:20,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:17:20,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:17:20,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:17:20,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:17:20,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:17:20,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:17:20,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:17:20,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:17:20,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:17:20,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:17:20,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:17:20,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:17:20,745 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:17:20,745 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:17:20,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:17:20,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:17:20,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:17:20,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:17:20,935 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:17:20,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-27 16:17:20,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4066c1a60/f6a7148d90c043f9b7f955e02e38ffef/FLAG955a4d9f4 [2022-04-27 16:17:21,350 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:17:21,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-27 16:17:21,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4066c1a60/f6a7148d90c043f9b7f955e02e38ffef/FLAG955a4d9f4 [2022-04-27 16:17:21,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4066c1a60/f6a7148d90c043f9b7f955e02e38ffef [2022-04-27 16:17:21,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:17:21,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:17:21,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:17:21,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:17:21,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:17:21,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15806db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21, skipping insertion in model container [2022-04-27 16:17:21,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:17:21,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:17:21,500 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-lit/bhmr2007.i[895,908] [2022-04-27 16:17:21,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:17:21,512 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:17:21,528 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-lit/bhmr2007.i[895,908] [2022-04-27 16:17:21,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:17:21,538 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:17:21,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21 WrapperNode [2022-04-27 16:17:21,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:17:21,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:17:21,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:17:21,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:17:21,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:17:21,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:17:21,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:17:21,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:17:21,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:17:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:21,586 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 16:17:21,591 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 16:17:21,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:17:21,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:17:21,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:17:21,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:17:21,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:17:21,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:17:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:17:21,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:17:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:17:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:17:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:17:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:17:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:17:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:17:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:17:21,675 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:17:21,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:17:21,812 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:17:21,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:17:21,817 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:17:21,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:21 BoogieIcfgContainer [2022-04-27 16:17:21,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:17:21,819 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:17:21,819 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:17:21,822 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:17:21,825 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:21" (1/1) ... [2022-04-27 16:17:21,826 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:17:21,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:17:21 BasicIcfg [2022-04-27 16:17:21,841 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:17:21,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:17:21,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:17:21,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:17:21,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:17:21" (1/4) ... [2022-04-27 16:17:21,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74406503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:17:21, skipping insertion in model container [2022-04-27 16:17:21,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:21" (2/4) ... [2022-04-27 16:17:21,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74406503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:17:21, skipping insertion in model container [2022-04-27 16:17:21,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:21" (3/4) ... [2022-04-27 16:17:21,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74406503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:17:21, skipping insertion in model container [2022-04-27 16:17:21,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:17:21" (4/4) ... [2022-04-27 16:17:21,846 INFO L111 eAbstractionObserver]: Analyzing ICFG bhmr2007.iJordan [2022-04-27 16:17:21,859 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:17:21,859 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:17:21,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:17:21,894 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@6306381d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d0d145e [2022-04-27 16:17:21,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:17:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 16:17:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:17:21,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:21,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:21,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1670666048, now seen corresponding path program 1 times [2022-04-27 16:17:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:21,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084624667] [2022-04-27 16:17:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 16:17:22,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:17:22,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:17:22,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:22,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 16:17:22,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:17:22,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:17:22,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:17:22,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {25#true} is VALID [2022-04-27 16:17:22,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:17:22,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [73] L28-2-->L28-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:17:22,037 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {26#false} is VALID [2022-04-27 16:17:22,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 16:17:22,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:17:22,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:17:22,038 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 16:17:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:22,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084624667] [2022-04-27 16:17:22,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084624667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:17:22,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:17:22,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:17:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819405235] [2022-04-27 16:17:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:17:22,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:17:22,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:22,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,066 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 16:17:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:17:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:17:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:17:22,089 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:22,146 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 16:17:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:17:22,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:17:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 16:17:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 16:17:22,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-27 16:17:22,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:22,206 INFO L225 Difference]: With dead ends: 22 [2022-04-27 16:17:22,207 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:17:22,208 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 16:17:22,211 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 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 16:17:22,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:17:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:17:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:17:22,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:22,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:17:22,234 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:17:22,234 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:17:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:22,239 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:17:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:17:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:22,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-27 16:17:22,241 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-27 16:17:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:22,243 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:17:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:17:22,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:22,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:22,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:22,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:17:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:17:22,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 16:17:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:22,247 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:17:22,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:17:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:17:22,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:22,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:17:22,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1671589569, now seen corresponding path program 1 times [2022-04-27 16:17:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741071297] [2022-04-27 16:17:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 16:17:22,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:17:22,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:17:22,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:22,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 16:17:22,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:17:22,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:17:22,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:17:22,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {105#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:22,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {106#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:22,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {107#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:22,480 INFO L272 TraceCheckUtils]: 8: Hoare triple {107#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:17:22,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {109#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:17:22,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {109#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:17:22,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:17:22,482 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 16:17:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:22,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741071297] [2022-04-27 16:17:22,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741071297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:17:22,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:17:22,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:17:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822157894] [2022-04-27 16:17:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:17:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:17:22,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:22,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,496 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 16:17:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:17:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:17:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:17:22,500 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:22,692 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 16:17:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:17:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:17:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-27 16:17:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-27 16:17:22,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-27 16:17:22,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:22,715 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:17:22,715 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:17:22,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:17:22,716 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:17:22,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:17:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:17:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 16:17:22,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:22,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,719 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,719 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:22,720 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:17:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:17:22,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:22,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:22,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:17:22,721 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:17:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:22,721 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:17:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:17:22,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:22,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:22,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:22,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 16:17:22,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-27 16:17:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:22,723 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 16:17:22,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 16:17:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:17:22,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:22,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:22,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:17:22,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash 830449136, now seen corresponding path program 1 times [2022-04-27 16:17:22,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:22,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582624950] [2022-04-27 16:17:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193#true} is VALID [2022-04-27 16:17:22,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:22,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:22,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:22,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193#true} is VALID [2022-04-27 16:17:22,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:22,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:22,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {193#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:22,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:22,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:22,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {199#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:22,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {200#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:22,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {201#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-27 16:17:22,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {202#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:17:22,930 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:17:22,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:17:22,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 16:17:22,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 16:17:22,932 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 16:17:22,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:22,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582624950] [2022-04-27 16:17:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582624950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:17:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189211980] [2022-04-27 16:17:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:17:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:22,938 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 16:17:22,941 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 16:17:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:22,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 16:17:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:23,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:17:23,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193#true} is VALID [2022-04-27 16:17:23,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {193#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:23,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:23,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {199#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:23,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {233#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:23,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 0))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {237#(and (<= 1 main_~n~0) (= main_~b~0 2) (<= main_~i~0 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 16:17:23,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(and (<= 1 main_~n~0) (= main_~b~0 2) (<= main_~i~0 1) (= (+ (- 1) main_~a~0) 0))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {241#(and (<= 1 main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (<= main_~n~0 1))} is VALID [2022-04-27 16:17:23,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {241#(and (<= 1 main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (<= main_~n~0 1))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:23,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:23,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 16:17:23,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 16:17:23,403 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 16:17:23,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:17:23,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 16:17:23,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 16:17:23,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:23,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:23,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {268#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {202#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:17:23,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {268#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:23,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {272#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:23,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {276#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-27 16:17:23,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {280#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-27 16:17:23,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {280#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-27 16:17:23,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {193#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193#true} is VALID [2022-04-27 16:17:23,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 16:17:23,723 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 16:17:23,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189211980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:17:23,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:17:23,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-27 16:17:23,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722280376] [2022-04-27 16:17:23,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:17:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:17:23,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:23,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:23,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:23,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 16:17:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 16:17:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 16:17:23,748 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:24,458 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 16:17:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 16:17:24,459 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:17:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2022-04-27 16:17:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2022-04-27 16:17:24,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 36 transitions. [2022-04-27 16:17:24,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:24,500 INFO L225 Difference]: With dead ends: 29 [2022-04-27 16:17:24,500 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 16:17:24,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 16:17:24,502 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:17:24,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 52 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:17:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 16:17:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 16:17:24,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:24,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 16:17:24,505 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 16:17:24,505 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 16:17:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:24,506 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 16:17:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 16:17:24,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:24,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:24,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 25 states. [2022-04-27 16:17:24,507 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 25 states. [2022-04-27 16:17:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:24,509 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 16:17:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 16:17:24,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:24,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:24,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:24,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 16:17:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-27 16:17:24,510 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2022-04-27 16:17:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:24,510 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-27 16:17:24,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 16:17:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 16:17:24,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:24,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:24,542 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 16:17:24,731 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 16:17:24,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash -941499008, now seen corresponding path program 1 times [2022-04-27 16:17:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:24,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722963943] [2022-04-27 16:17:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:24,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {433#true} is VALID [2022-04-27 16:17:24,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {433#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:24,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {433#true} {433#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:24,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {433#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:24,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {433#true} is VALID [2022-04-27 16:17:24,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:24,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {433#true} {433#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:24,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {433#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:24,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:24,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:24,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:24,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [78] L29-->L29-2: Formula: (and (= v_main_~b~0_1 (+ v_main_~b~0_2 1)) (= |v_main_#t~nondet2_2| 0) (= (+ v_main_~a~0_2 2) v_main_~a~0_1)) InVars {main_~b~0=v_main_~b~0_2, main_#t~nondet2=|v_main_#t~nondet2_2|, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {439#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} is VALID [2022-04-27 16:17:24,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 16:17:24,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {441#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} is VALID [2022-04-27 16:17:24,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {442#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:24,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {442#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {443#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-27 16:17:24,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {444#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:17:24,929 INFO L272 TraceCheckUtils]: 14: Hoare triple {444#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {445#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:17:24,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {446#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:17:24,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {446#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#false} is VALID [2022-04-27 16:17:24,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {434#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#false} is VALID [2022-04-27 16:17:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:17:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:24,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722963943] [2022-04-27 16:17:24,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722963943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:17:24,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356741380] [2022-04-27 16:17:24,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:24,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:17:24,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:24,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:17:24,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:17:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:24,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 16:17:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:24,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:17:25,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {433#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {433#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {433#true} is VALID [2022-04-27 16:17:25,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {433#true} {433#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {433#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:25,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:25,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:25,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [78] L29-->L29-2: Formula: (and (= v_main_~b~0_1 (+ v_main_~b~0_2 1)) (= |v_main_#t~nondet2_2| 0) (= (+ v_main_~a~0_2 2) v_main_~a~0_1)) InVars {main_~b~0=v_main_~b~0_2, main_#t~nondet2=|v_main_#t~nondet2_2|, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {475#(and (= main_~i~0 0) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-27 16:17:25,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(and (= main_~i~0 0) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {479#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-27 16:17:25,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {479#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {483#(and (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-27 16:17:25,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#(and (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {487#(and (< main_~i~0 main_~n~0) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (= main_~i~0 1))} is VALID [2022-04-27 16:17:25,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {487#(and (< main_~i~0 main_~n~0) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (= main_~i~0 1))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {491#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0) (<= main_~i~0 2))} is VALID [2022-04-27 16:17:25,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0) (<= main_~i~0 2))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {495#(and (<= main_~n~0 2) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0))} is VALID [2022-04-27 16:17:25,314 INFO L272 TraceCheckUtils]: 14: Hoare triple {495#(and (<= main_~n~0 2) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:25,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {499#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:25,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {503#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#false} is VALID [2022-04-27 16:17:25,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {434#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#false} is VALID [2022-04-27 16:17:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:17:25,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:17:25,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {434#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#false} is VALID [2022-04-27 16:17:25,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {503#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#false} is VALID [2022-04-27 16:17:25,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {499#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:25,628 INFO L272 TraceCheckUtils]: 14: Hoare triple {444#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:25,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {522#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {444#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:17:25,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {522#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:25,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {526#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:17:25,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {530#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-27 16:17:25,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 16:17:25,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [78] L29-->L29-2: Formula: (and (= v_main_~b~0_1 (+ v_main_~b~0_2 1)) (= |v_main_#t~nondet2_2| 0) (= (+ v_main_~a~0_2 2) v_main_~a~0_1)) InVars {main_~b~0=v_main_~b~0_2, main_#t~nondet2=|v_main_#t~nondet2_2|, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {537#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:17:25,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 16:17:25,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 16:17:25,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {440#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 16:17:25,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {433#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {433#true} {433#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {433#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {433#true} is VALID [2022-04-27 16:17:25,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {433#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#true} is VALID [2022-04-27 16:17:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:17:25,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356741380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:17:25,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:17:25,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-27 16:17:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094779318] [2022-04-27 16:17:25,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:17:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 16:17:25,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:25,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:25,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:25,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 16:17:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 16:17:25,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-27 16:17:25,667 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:26,369 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 16:17:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 16:17:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 16:17:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-04-27 16:17:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-04-27 16:17:26,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 29 transitions. [2022-04-27 16:17:26,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:26,397 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:17:26,397 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:17:26,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 16:17:26,398 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:17:26,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 65 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:17:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:17:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:17:26,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:26,399 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 16:17:26,399 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 16:17:26,399 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 16:17:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:26,400 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:17:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:17:26,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:26,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:26,400 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 16:17:26,400 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 16:17:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:26,400 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:17:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:17:26,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:26,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:26,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:26,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:26,400 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 16:17:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:17:26,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 16:17:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:26,401 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:17:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:17:26,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:26,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:17:26,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:17:26,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:17:26,619 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 16:17:26,621 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:17:26,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:17:26 BasicIcfg [2022-04-27 16:17:26,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:17:26,624 INFO L158 Benchmark]: Toolchain (without parser) took 5253.07ms. Allocated memory was 186.6MB in the beginning and 227.5MB in the end (delta: 40.9MB). Free memory was 138.8MB in the beginning and 109.4MB in the end (delta: 29.4MB). Peak memory consumption was 71.7MB. Max. memory is 8.0GB. [2022-04-27 16:17:26,624 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:17:26,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.49ms. Allocated memory is still 186.6MB. Free memory was 138.7MB in the beginning and 163.2MB in the end (delta: -24.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:17:26,626 INFO L158 Benchmark]: Boogie Preprocessor took 17.18ms. Allocated memory is still 186.6MB. Free memory was 163.2MB in the beginning and 161.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:17:26,626 INFO L158 Benchmark]: RCFGBuilder took 261.04ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 150.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:17:26,627 INFO L158 Benchmark]: IcfgTransformer took 22.43ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 149.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:17:26,627 INFO L158 Benchmark]: TraceAbstraction took 4781.15ms. Allocated memory was 186.6MB in the beginning and 227.5MB in the end (delta: 40.9MB). Free memory was 148.8MB in the beginning and 109.4MB in the end (delta: 39.4MB). Peak memory consumption was 81.6MB. Max. memory is 8.0GB. [2022-04-27 16:17:26,631 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.49ms. Allocated memory is still 186.6MB. Free memory was 138.7MB in the beginning and 163.2MB in the end (delta: -24.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.18ms. Allocated memory is still 186.6MB. Free memory was 163.2MB in the beginning and 161.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 261.04ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 150.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.43ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 149.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4781.15ms. Allocated memory was 186.6MB in the beginning and 227.5MB in the end (delta: 40.9MB). Free memory was 148.8MB in the beginning and 109.4MB in the end (delta: 39.4MB). Peak memory consumption was 81.6MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 52 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 926 SizeOfPredicates, 6 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:17:26,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...