/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/nla-digbench-scaling/sqrt1-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:19:59,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:19:59,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:19:59,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:19:59,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:19:59,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:19:59,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:19:59,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:19:59,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:19:59,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:19:59,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:19:59,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:19:59,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:19:59,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:19:59,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:19:59,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:19:59,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:19:59,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:19:59,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:19:59,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:19:59,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:19:59,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:19:59,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:19:59,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:19:59,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:19:59,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:19:59,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:19:59,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:19:59,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:19:59,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:19:59,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:19:59,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:19:59,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:19:59,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:19:59,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:19:59,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:19:59,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:19:59,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:19:59,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:19:59,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:19:59,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:19:59,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:19:59,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:19:59,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:19:59,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:19:59,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:19:59,956 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:19:59,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:19:59,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:19:59,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:19:59,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:19:59,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:19:59,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:19:59,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:19:59,958 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:19:59,958 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 20:20:00,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:20:00,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:20:00,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:20:00,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:20:00,158 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:20:00,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-27 20:20:00,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32217415/ac3666aa2e2b47749db1bca9aa14c52e/FLAGb1244e019 [2022-04-27 20:20:00,506 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:20:00,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-27 20:20:00,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32217415/ac3666aa2e2b47749db1bca9aa14c52e/FLAGb1244e019 [2022-04-27 20:20:00,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e32217415/ac3666aa2e2b47749db1bca9aa14c52e [2022-04-27 20:20:00,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:20:00,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:20:00,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:20:00,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:20:00,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:20:00,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:20:00" (1/1) ... [2022-04-27 20:20:00,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23961c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:00, skipping insertion in model container [2022-04-27 20:20:00,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:20:00" (1/1) ... [2022-04-27 20:20:00,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:20:00,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:20:01,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c[520,533] [2022-04-27 20:20:01,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:20:01,141 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:20:01,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c[520,533] [2022-04-27 20:20:01,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:20:01,164 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:20:01,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01 WrapperNode [2022-04-27 20:20:01,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:20:01,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:20:01,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:20:01,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:20:01,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:20:01,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:20:01,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:20:01,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:20:01,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:20:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:20:01,219 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 20:20:01,224 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 20:20:01,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:20:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:20:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:20:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 20:20:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 20:20:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:20:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:20:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:20:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:20:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:20:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:20:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:20:01,299 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:20:01,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:20:01,507 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:20:01,512 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:20:01,512 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:20:01,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:20:01 BoogieIcfgContainer [2022-04-27 20:20:01,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:20:01,514 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:20:01,514 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:20:01,515 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:20:01,520 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:20:01" (1/1) ... [2022-04-27 20:20:01,521 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:20:01,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:20:01 BasicIcfg [2022-04-27 20:20:01,560 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:20:01,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:20:01,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:20:01,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:20:01,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:20:00" (1/4) ... [2022-04-27 20:20:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb1bc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:20:01, skipping insertion in model container [2022-04-27 20:20:01,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:20:01" (2/4) ... [2022-04-27 20:20:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb1bc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:20:01, skipping insertion in model container [2022-04-27 20:20:01,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:20:01" (3/4) ... [2022-04-27 20:20:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb1bc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:20:01, skipping insertion in model container [2022-04-27 20:20:01,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:20:01" (4/4) ... [2022-04-27 20:20:01,568 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound100.cJordan [2022-04-27 20:20:01,578 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:20:01,578 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:20:01,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:20:01,626 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@462bbe18, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a790e3 [2022-04-27 20:20:01,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:20:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:20:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:20:01,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:20:01,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:20:01,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:20:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:20:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -179702132, now seen corresponding path program 1 times [2022-04-27 20:20:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:20:01,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391729317] [2022-04-27 20:20:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:20:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:20:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:01,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 20:20:01,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 20:20:01,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 20:20:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 20:20:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:01,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 20:20:01,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [84] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 20:20:01,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:20:01,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 20:20:01,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 20:20:01,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 20:20:01,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 20:20:01,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {34#true} is VALID [2022-04-27 20:20:01,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-27 20:20:01,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 20:20:01,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [84] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 20:20:01,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {35#false} is VALID [2022-04-27 20:20:01,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} [81] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,812 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} [86] L30-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_11 (+ (* 2 v_main_~a~0_11) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {35#false} is VALID [2022-04-27 20:20:01,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-27 20:20:01,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 20:20:01,813 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 20:20:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:20:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391729317] [2022-04-27 20:20:01,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391729317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:20:01,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:20:01,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 20:20:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451992224] [2022-04-27 20:20:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:20:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 20:20:01,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:20:01,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:01,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:01,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 20:20:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:20:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 20:20:01,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 20:20:01,866 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:01,980 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 20:20:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 20:20:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 20:20:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:20:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 20:20:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 20:20:01,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 20:20:02,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:02,046 INFO L225 Difference]: With dead ends: 31 [2022-04-27 20:20:02,046 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 20:20:02,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 20:20:02,050 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:20:02,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:20:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 20:20:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 20:20:02,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:20:02,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:20:02,069 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:20:02,070 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:20:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:02,073 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 20:20:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 20:20:02,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:02,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:02,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 20:20:02,074 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 20:20:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:02,077 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 20:20:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 20:20:02,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:02,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:02,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:20:02,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:20:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:20:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 20:20:02,080 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 20:20:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:20:02,081 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 20:20:02,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 20:20:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:20:02,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:20:02,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:20:02,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:20:02,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:20:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:20:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1985279762, now seen corresponding path program 1 times [2022-04-27 20:20:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:20:02,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110541778] [2022-04-27 20:20:02,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:20:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:20:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:02,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {155#true} is VALID [2022-04-27 20:20:02,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155#true} {155#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 20:20:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:02,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {155#true} is VALID [2022-04-27 20:20:02,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {155#true} is VALID [2022-04-27 20:20:02,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:20:02,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {155#true} is VALID [2022-04-27 20:20:02,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {155#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {155#true} is VALID [2022-04-27 20:20:02,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {155#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {155#true} is VALID [2022-04-27 20:20:02,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {155#true} is VALID [2022-04-27 20:20:02,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-27 20:20:02,196 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {155#true} {155#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {155#true} is VALID [2022-04-27 20:20:02,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 20:20:02,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 20:20:02,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {164#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 20:20:02,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {165#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {166#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 20:20:02,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= __VERIFIER_assert_~cond 0))} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-27 20:20:02,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {156#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-27 20:20:02,199 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 20:20:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:20:02,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110541778] [2022-04-27 20:20:02,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110541778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:20:02,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:20:02,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 20:20:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958182310] [2022-04-27 20:20:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:20:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 20:20:02,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:20:02,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:02,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:02,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 20:20:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:20:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 20:20:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 20:20:02,227 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:02,587 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 20:20:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 20:20:02,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 20:20:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:20:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-27 20:20:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-27 20:20:02,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-27 20:20:02,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:02,642 INFO L225 Difference]: With dead ends: 38 [2022-04-27 20:20:02,642 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 20:20:02,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 20:20:02,643 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:20:02,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:20:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 20:20:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-27 20:20:02,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:20:02,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:20:02,647 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:20:02,648 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:20:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:02,650 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 20:20:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 20:20:02,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:02,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:02,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 20:20:02,651 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 20:20:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:02,654 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 20:20:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 20:20:02,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:02,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:02,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:20:02,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:20:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:20:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 20:20:02,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-27 20:20:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:20:02,657 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 20:20:02,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:20:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 20:20:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:20:02,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:20:02,658 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:20:02,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 20:20:02,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:20:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:20:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1146988413, now seen corresponding path program 1 times [2022-04-27 20:20:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:20:02,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53958030] [2022-04-27 20:20:02,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:02,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:20:02,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:20:02,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072736686] [2022-04-27 20:20:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:02,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:20:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:20:02,680 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 20:20:02,681 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 20:20:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:02,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 20:20:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:02,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:20:02,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {328#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {328#true} is VALID [2022-04-27 20:20:02,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {328#true} is VALID [2022-04-27 20:20:02,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {328#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {328#true} is VALID [2022-04-27 20:20:02,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {328#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {328#true} is VALID [2022-04-27 20:20:02,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {328#true} {328#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {328#true} is VALID [2022-04-27 20:20:02,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {366#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 20:20:02,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#(and (= main_~a~0 0) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 20:20:02,946 INFO L272 TraceCheckUtils]: 13: Hoare triple {366#(and (= main_~a~0 0) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {328#true} is VALID [2022-04-27 20:20:02,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {328#true} is VALID [2022-04-27 20:20:02,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 20:20:02,947 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {328#true} {366#(and (= main_~a~0 0) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {366#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 20:20:02,948 INFO L272 TraceCheckUtils]: 18: Hoare triple {366#(and (= main_~a~0 0) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:20:02,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {388#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:20:02,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {392#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 20:20:02,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {329#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 20:20:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:20:02,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:20:02,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:20:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53958030] [2022-04-27 20:20:02,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:20:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072736686] [2022-04-27 20:20:02,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072736686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:20:02,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:20:02,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 20:20:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536294312] [2022-04-27 20:20:02,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:20:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 20:20:02,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:20:02,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:20:02,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:02,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:20:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:20:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:20:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:20:02,971 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:20:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:03,110 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 20:20:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:20:03,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 20:20:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:20:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:20:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 20:20:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:20:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 20:20:03,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 20:20:03,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:03,156 INFO L225 Difference]: With dead ends: 42 [2022-04-27 20:20:03,156 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 20:20:03,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 20:20:03,160 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:20:03,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:20:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 20:20:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-27 20:20:03,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:20:03,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:20:03,165 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:20:03,165 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:20:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:03,175 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 20:20:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 20:20:03,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:03,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:03,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 20:20:03,180 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 20:20:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:03,182 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 20:20:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 20:20:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:03,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:20:03,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:20:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:20:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-27 20:20:03,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-27 20:20:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:20:03,188 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-27 20:20:03,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:20:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 20:20:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 20:20:03,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:20:03,189 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:20:03,210 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 20:20:03,390 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 20:20:03,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:20:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:20:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash -88951989, now seen corresponding path program 1 times [2022-04-27 20:20:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:20:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355627795] [2022-04-27 20:20:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:20:03,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:20:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54930194] [2022-04-27 20:20:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:20:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:20:03,406 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 20:20:03,412 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 20:20:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:03,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 20:20:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:03,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:20:03,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {567#true} is VALID [2022-04-27 20:20:03,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {567#true} is VALID [2022-04-27 20:20:03,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:03,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:03,585 INFO L272 TraceCheckUtils]: 13: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {567#true} is VALID [2022-04-27 20:20:03,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {567#true} is VALID [2022-04-27 20:20:03,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,600 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {567#true} {605#(and (= main_~t~0 1) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:03,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {567#true} is VALID [2022-04-27 20:20:03,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {567#true} is VALID [2022-04-27 20:20:03,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-27 20:20:03,606 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {567#true} {605#(and (= main_~t~0 1) (= main_~s~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {605#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:03,606 INFO L272 TraceCheckUtils]: 23: Hoare triple {605#(and (= main_~t~0 1) (= main_~s~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:20:03,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {642#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:20:03,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {646#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-27 20:20:03,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {568#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-27 20:20:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 20:20:03,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:20:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:20:03,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355627795] [2022-04-27 20:20:03,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:20:03,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54930194] [2022-04-27 20:20:03,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54930194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:20:03,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:20:03,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 20:20:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984382756] [2022-04-27 20:20:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:20:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 20:20:03,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:20:03,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:20:03,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:03,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:20:03,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:20:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:20:03,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:20:03,632 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:20:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:03,743 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-27 20:20:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:20:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 20:20:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:20:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:20:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 20:20:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:20:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 20:20:03,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 20:20:03,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:03,786 INFO L225 Difference]: With dead ends: 46 [2022-04-27 20:20:03,786 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 20:20:03,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 20:20:03,788 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:20:03,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:20:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 20:20:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 20:20:03,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:20:03,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:03,798 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:03,799 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:03,805 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 20:20:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 20:20:03,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:03,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:03,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 20:20:03,807 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 20:20:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:03,810 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 20:20:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 20:20:03,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:03,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:03,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:20:03,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:20:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-27 20:20:03,814 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-27 20:20:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:20:03,814 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-27 20:20:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:20:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 20:20:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 20:20:03,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:20:03,815 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:20:03,834 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 20:20:04,032 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 20:20:04,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:20:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:20:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash 196845204, now seen corresponding path program 1 times [2022-04-27 20:20:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:20:04,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254199591] [2022-04-27 20:20:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:20:04,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:20:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420711813] [2022-04-27 20:20:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:04,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:20:04,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:20:04,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:20:04,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 20:20:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:04,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 20:20:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:04,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:20:04,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {829#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-27 20:20:04,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {829#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {829#true} is VALID [2022-04-27 20:20:04,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {829#true} {829#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-27 20:20:04,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 20:20:04,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 20:20:04,247 INFO L272 TraceCheckUtils]: 13: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {829#true} is VALID [2022-04-27 20:20:04,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {829#true} is VALID [2022-04-27 20:20:04,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {829#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,247 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {829#true} {867#(and (= main_~a~0 0) (= main_~t~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 20:20:04,248 INFO L272 TraceCheckUtils]: 18: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-27 20:20:04,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {829#true} is VALID [2022-04-27 20:20:04,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,249 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {829#true} {867#(and (= main_~a~0 0) (= main_~t~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 20:20:04,249 INFO L272 TraceCheckUtils]: 23: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {829#true} is VALID [2022-04-27 20:20:04,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {829#true} is VALID [2022-04-27 20:20:04,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {829#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,251 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {829#true} {867#(and (= main_~a~0 0) (= main_~t~0 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {867#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 20:20:04,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {867#(and (= main_~a~0 0) (= main_~t~0 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 20:20:04,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 20:20:04,253 INFO L272 TraceCheckUtils]: 30: Hoare triple {919#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:20:04,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {926#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:20:04,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {930#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {830#false} is VALID [2022-04-27 20:20:04,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {830#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {830#false} is VALID [2022-04-27 20:20:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 20:20:04,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:20:04,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {830#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {830#false} is VALID [2022-04-27 20:20:04,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {930#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {830#false} is VALID [2022-04-27 20:20:04,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {926#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:20:04,406 INFO L272 TraceCheckUtils]: 30: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:20:04,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,408 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {829#true} {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {829#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {829#true} is VALID [2022-04-27 20:20:04,408 INFO L272 TraceCheckUtils]: 23: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {829#true} is VALID [2022-04-27 20:20:04,410 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {829#true} {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {829#true} is VALID [2022-04-27 20:20:04,410 INFO L272 TraceCheckUtils]: 18: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-27 20:20:04,411 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {829#true} {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {829#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {829#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {829#true} is VALID [2022-04-27 20:20:04,411 INFO L272 TraceCheckUtils]: 13: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {829#true} is VALID [2022-04-27 20:20:04,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {946#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 20:20:04,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {829#true} {829#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {829#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {829#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {829#true} is VALID [2022-04-27 20:20:04,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {829#true} is VALID [2022-04-27 20:20:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 20:20:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:20:04,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254199591] [2022-04-27 20:20:04,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:20:04,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420711813] [2022-04-27 20:20:04,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420711813] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 20:20:04,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:20:04,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 20:20:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884684628] [2022-04-27 20:20:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:20:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 20:20:04,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:20:04,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 20:20:04,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:04,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:20:04,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:20:04,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:20:04,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 20:20:04,436 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 20:20:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:04,536 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 20:20:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:20:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 20:20:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:20:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 20:20:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 20:20:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 20:20:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 20:20:04,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 20:20:04,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:04,563 INFO L225 Difference]: With dead ends: 47 [2022-04-27 20:20:04,563 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 20:20:04,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 20:20:04,564 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:20:04,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:20:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 20:20:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 20:20:04,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:20:04,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:04,567 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:04,567 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:04,569 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 20:20:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 20:20:04,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:04,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:04,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 20:20:04,569 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 20:20:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:04,571 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 20:20:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 20:20:04,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:04,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:04,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:20:04,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:20:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:20:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-27 20:20:04,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-27 20:20:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:20:04,573 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-27 20:20:04,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 20:20:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 20:20:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 20:20:04,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:20:04,573 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:20:04,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 20:20:04,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:20:04,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:20:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:20:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -374953577, now seen corresponding path program 2 times [2022-04-27 20:20:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:20:04,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344718512] [2022-04-27 20:20:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:20:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:20:04,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:20:04,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184587420] [2022-04-27 20:20:04,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:20:04,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:20:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:20:04,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:20:04,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 20:20:04,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:20:04,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:20:04,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 20:20:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:20:04,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:20:05,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {1229#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1229#true} is VALID [2022-04-27 20:20:05,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#true} {1229#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#true} {1229#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-27 20:20:05,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:05,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:05,019 INFO L272 TraceCheckUtils]: 13: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,020 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1229#true} {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:05,020 INFO L272 TraceCheckUtils]: 18: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,023 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1229#true} {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:05,023 INFO L272 TraceCheckUtils]: 23: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1229#true} is VALID [2022-04-27 20:20:05,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,024 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1229#true} {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 20:20:05,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {1267#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 20:20:05,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 20:20:05,025 INFO L272 TraceCheckUtils]: 30: Hoare triple {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,030 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1229#true} {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 20:20:05,031 INFO L272 TraceCheckUtils]: 35: Hoare triple {1319#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:20:05,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:20:05,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {1345#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1230#false} is VALID [2022-04-27 20:20:05,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {1230#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#false} is VALID [2022-04-27 20:20:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 20:20:05,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:20:05,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {1230#false} [97] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#false} is VALID [2022-04-27 20:20:05,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {1345#(<= 1 __VERIFIER_assert_~cond)} [93] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1230#false} is VALID [2022-04-27 20:20:05,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:20:05,190 INFO L272 TraceCheckUtils]: 35: Hoare triple {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:20:05,191 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1229#true} {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 20:20:05,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,191 INFO L272 TraceCheckUtils]: 30: Hoare triple {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 20:20:05,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [101] L33-->L30-2: Formula: (and (= v_main_~t~0_7 (+ v_main_~t~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) (<= v_main_~s~0_9 v_main_~n~0_6) (= (+ v_main_~s~0_9 v_main_~t~0_7) v_main_~s~0_8)) InVars {main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~t~0=v_main_~t~0_7, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1361#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 20:20:05,279 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1229#true} {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [107] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 20:20:05,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,280 INFO L272 TraceCheckUtils]: 23: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [95] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~s~0_11 (- 4)) (* v_main_~t~0_10 v_main_~t~0_10) (* v_main_~t~0_10 2) 1) 0) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1229#true} is VALID [2022-04-27 20:20:05,281 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1229#true} {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [106] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 20:20:05,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,281 INFO L272 TraceCheckUtils]: 18: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [91] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_10 (let ((.cse0 (+ 1 v_main_~a~0_10))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,283 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1229#true} {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [105] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 20:20:05,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#true} [99] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {1229#true} [94] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#true} [90] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1229#true} is VALID [2022-04-27 20:20:05,284 INFO L272 TraceCheckUtils]: 13: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [87] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~a~0_9 2) 1) v_main_~t~0_9) 1 0)) InVars {main_~t~0=v_main_~t~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_~t~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [83] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 20:20:05,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#true} [79] L24-1-->L30-2: Formula: (and (= v_main_~s~0_4 1) (= v_main_~t~0_4 1) (= v_main_~a~0_4 0)) InVars {} OutVars{main_~t~0=v_main_~t~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1383#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 20:20:05,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#true} {1229#true} [104] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-27 20:20:05,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#true} [85] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#true} [80] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1229#true} is VALID [2022-04-27 20:20:05,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#true} [78] L24-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~n~0_7 100) (<= 0 v_main_~n~0_7)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1229#true} is VALID [2022-04-27 20:20:05,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#true} [76] mainENTRY-->L24: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1229#true} is VALID [2022-04-27 20:20:05,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#true} {1229#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#true} [74] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1229#true} is VALID [2022-04-27 20:20:05,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1229#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#true} is VALID [2022-04-27 20:20:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 20:20:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:20:05,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344718512] [2022-04-27 20:20:05,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:20:05,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184587420] [2022-04-27 20:20:05,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184587420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 20:20:05,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 20:20:05,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 20:20:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751674294] [2022-04-27 20:20:05,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 20:20:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 20:20:05,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:20:05,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 20:20:05,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 20:20:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:20:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 20:20:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 20:20:05,324 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 20:20:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:05,724 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 20:20:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 20:20:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 20:20:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:20:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 20:20:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-27 20:20:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 20:20:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-27 20:20:05,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-27 20:20:05,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:20:05,792 INFO L225 Difference]: With dead ends: 53 [2022-04-27 20:20:05,792 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 20:20:05,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 20:20:05,793 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:20:05,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:20:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 20:20:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 20:20:05,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:20:05,794 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 20:20:05,794 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 20:20:05,794 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 20:20:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:05,794 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:20:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:20:05,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:05,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:05,794 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 20:20:05,794 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 20:20:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:20:05,795 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:20:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:20:05,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:05,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:20:05,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:20:05,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:20:05,795 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 20:20:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 20:20:05,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 20:20:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:20:05,795 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 20:20:05,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 20:20:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:20:05,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:20:05,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 20:20:05,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 20:20:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:20:06,000 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 20:20:06,001 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 20:20:06,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:20:06 BasicIcfg [2022-04-27 20:20:06,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 20:20:06,004 INFO L158 Benchmark]: Toolchain (without parser) took 5042.53ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 116.5MB in the beginning and 153.3MB in the end (delta: -36.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:20:06,004 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:20:06,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.52ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 116.3MB in the beginning and 177.8MB in the end (delta: -61.5MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-04-27 20:20:06,004 INFO L158 Benchmark]: Boogie Preprocessor took 24.46ms. Allocated memory is still 206.6MB. Free memory was 177.8MB in the beginning and 176.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 20:20:06,004 INFO L158 Benchmark]: RCFGBuilder took 323.06ms. Allocated memory is still 206.6MB. Free memory was 176.1MB in the beginning and 165.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 20:20:06,004 INFO L158 Benchmark]: IcfgTransformer took 46.09ms. Allocated memory is still 206.6MB. Free memory was 165.2MB in the beginning and 163.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 20:20:06,005 INFO L158 Benchmark]: TraceAbstraction took 4441.64ms. Allocated memory is still 206.6MB. Free memory was 163.1MB in the beginning and 153.3MB in the end (delta: 9.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-27 20:20:06,005 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.13ms. Allocated memory is still 172.0MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.52ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 116.3MB in the beginning and 177.8MB in the end (delta: -61.5MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.46ms. Allocated memory is still 206.6MB. Free memory was 177.8MB in the beginning and 176.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.06ms. Allocated memory is still 206.6MB. Free memory was 176.1MB in the beginning and 165.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 46.09ms. Allocated memory is still 206.6MB. Free memory was 165.2MB in the beginning and 163.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4441.64ms. Allocated memory is still 206.6MB. Free memory was 163.1MB in the beginning and 153.3MB in the end (delta: 9.8MB). Peak memory consumption was 11.2MB. 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: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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 20:20:06,031 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...