/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:25:45,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:25:45,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:25:45,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:25:45,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:25:45,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:25:45,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:25:45,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:25:45,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:25:45,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:25:45,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:25:45,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:25:45,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:25:45,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:25:45,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:25:45,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:25:45,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:25:45,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:25:45,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:25:45,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:25:45,605 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:25:45,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:25:45,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:25:45,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:25:45,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:25:45,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:25:45,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:25:45,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:25:45,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:25:45,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:25:45,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:25:45,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:25:45,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:25:45,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:25:45,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:25:45,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:25:45,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:25:45,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:25:45,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:25:45,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:25:45,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:25:45,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:25:45,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:25:45,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:25:45,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:25:45,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:25:45,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:25:45,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:25:45,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:25:45,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:25:45,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:25:45,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:25:45,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:25:45,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:25:45,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:25:45,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:25:45,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:25:45,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:25:45,648 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:25:45,648 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:25:45,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:25:45,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:25:45,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:25:45,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:25:45,856 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:25:45,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2022-04-27 16:25:45,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba16174b4/9e335bb5f0ba45df9e08f89b5e1af5ae/FLAGbaded1b6e [2022-04-27 16:25:46,199 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:25:46,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-27 16:25:46,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba16174b4/9e335bb5f0ba45df9e08f89b5e1af5ae/FLAGbaded1b6e [2022-04-27 16:25:46,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba16174b4/9e335bb5f0ba45df9e08f89b5e1af5ae [2022-04-27 16:25:46,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:25:46,635 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:25:46,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:25:46,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:25:46,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:25:46,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5729bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46, skipping insertion in model container [2022-04-27 16:25:46,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:25:46,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:25:46,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i[891,904] [2022-04-27 16:25:46,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:25:46,781 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:25:46,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i[891,904] [2022-04-27 16:25:46,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:25:46,806 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:25:46,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46 WrapperNode [2022-04-27 16:25:46,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:25:46,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:25:46,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:25:46,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:25:46,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:25:46,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:25:46,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:25:46,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:25:46,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (1/1) ... [2022-04-27 16:25:46,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:25:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:46,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:25:46,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:25:46,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:25:46,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:25:46,904 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:25:46,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:25:46,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:25:46,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:25:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:25:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:25:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:25:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:25:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:25:46,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:25:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:25:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:25:46,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:25:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:25:46,965 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:25:46,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:25:47,081 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:25:47,086 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:25:47,086 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:25:47,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:47 BoogieIcfgContainer [2022-04-27 16:25:47,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:25:47,088 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:25:47,088 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:25:47,088 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:25:47,090 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:47" (1/1) ... [2022-04-27 16:25:47,092 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:25:47,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:25:47 BasicIcfg [2022-04-27 16:25:47,107 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:25:47,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:25:47,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:25:47,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:25:47,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:25:46" (1/4) ... [2022-04-27 16:25:47,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb61e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:25:47, skipping insertion in model container [2022-04-27 16:25:47,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:46" (2/4) ... [2022-04-27 16:25:47,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb61e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:25:47, skipping insertion in model container [2022-04-27 16:25:47,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:47" (3/4) ... [2022-04-27 16:25:47,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb61e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:25:47, skipping insertion in model container [2022-04-27 16:25:47,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:25:47" (4/4) ... [2022-04-27 16:25:47,114 INFO L111 eAbstractionObserver]: Analyzing ICFG half.iJordan [2022-04-27 16:25:47,134 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:25:47,135 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:25:47,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:25:47,179 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@5eb1fe63, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23e5bbbe [2022-04-27 16:25:47,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:25:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:25:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:25:47,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:47,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:47,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1612362112, now seen corresponding path program 1 times [2022-04-27 16:25:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:47,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114015788] [2022-04-27 16:25:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:47,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 16:25:47,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:25:47,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:25:47,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 16:25:47,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:25:47,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:25:47,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:25:47,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {25#true} is VALID [2022-04-27 16:25:47,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {25#true} is VALID [2022-04-27 16:25:47,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [72] L29-3-->L29-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:25:47,372 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {26#false} is VALID [2022-04-27 16:25:47,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 16:25:47,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:25:47,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:25:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114015788] [2022-04-27 16:25:47,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114015788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:25:47,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:25:47,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:25:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336439166] [2022-04-27 16:25:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:25:47,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:47,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:47,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:47,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:25:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:25:47,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:25:47,424 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:47,494 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 16:25:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:25:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 16:25:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 16:25:47,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-27 16:25:47,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:47,532 INFO L225 Difference]: With dead ends: 22 [2022-04-27 16:25:47,532 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:25:47,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:25:47,536 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:47,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:25:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:25:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:25:47,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:47,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,553 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,554 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:47,556 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:25:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:25:47,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:47,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:47,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:25:47,556 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:25:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:47,558 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:25:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:25:47,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:47,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:47,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:47,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:25:47,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 16:25:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:47,561 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:25:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:25:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:25:47,561 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:47,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:47,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:25:47,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1611438591, now seen corresponding path program 1 times [2022-04-27 16:25:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:47,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356702504] [2022-04-27 16:25:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:47,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 16:25:47,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:25:47,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:25:47,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:47,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 16:25:47,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:25:47,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:25:47,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:25:47,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {105#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:25:47,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {106#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:25:47,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {107#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:25:47,745 INFO L272 TraceCheckUtils]: 8: Hoare triple {107#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:25:47,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {109#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:25:47,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {109#(not (= __VERIFIER_assert_~cond 0))} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:25:47,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:25:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:47,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:47,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356702504] [2022-04-27 16:25:47,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356702504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:25:47,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:25:47,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:25:47,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840592563] [2022-04-27 16:25:47,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:25:47,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:47,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:47,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:25:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:25:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:25:47,766 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:47,999 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 16:25:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:25:48,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:25:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-27 16:25:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-27 16:25:48,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-27 16:25:48,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:48,042 INFO L225 Difference]: With dead ends: 25 [2022-04-27 16:25:48,042 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 16:25:48,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:25:48,043 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:48,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 38 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:25:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 16:25:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-27 16:25:48,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:48,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,046 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,046 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:48,047 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 16:25:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 16:25:48,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:48,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:48,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 16:25:48,048 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 16:25:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:48,049 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 16:25:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 16:25:48,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:48,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:48,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:48,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 16:25:48,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-27 16:25:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:48,051 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 16:25:48,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 16:25:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:25:48,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:48,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:48,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:25:48,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1133798095, now seen corresponding path program 1 times [2022-04-27 16:25:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:48,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393167398] [2022-04-27 16:25:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:48,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 16:25:48,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:48,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 16:25:48,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {213#(= main_~n~0 0)} is VALID [2022-04-27 16:25:48,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {214#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:48,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {215#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 16:25:48,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {216#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= (+ main_~i~0 (* main_~n~0 2)) (+ (* main_~k~0 2) 1)))} is VALID [2022-04-27 16:25:48,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {216#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= (+ main_~i~0 (* main_~n~0 2)) (+ (* main_~k~0 2) 1)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {217#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:48,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {217#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,161 INFO L272 TraceCheckUtils]: 11: Hoare triple {209#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {209#false} is VALID [2022-04-27 16:25:48,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-27 16:25:48,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:48,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393167398] [2022-04-27 16:25:48,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393167398] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:25:48,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589351942] [2022-04-27 16:25:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:48,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:48,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:25:48,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:25:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:48,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:25:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:48,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:48,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 16:25:48,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {213#(= main_~n~0 0)} is VALID [2022-04-27 16:25:48,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {214#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:48,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {215#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 16:25:48,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {246#(and (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 16:25:48,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(and (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {250#(and (<= main_~i~0 1) (<= 1 (* main_~k~0 2)))} is VALID [2022-04-27 16:25:48,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#(and (<= main_~i~0 1) (<= 1 (* main_~k~0 2)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {209#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {209#false} is VALID [2022-04-27 16:25:48,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-27 16:25:48,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:48,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:25:48,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-27 16:25:48,450 INFO L272 TraceCheckUtils]: 11: Hoare triple {209#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {209#false} is VALID [2022-04-27 16:25:48,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {278#(< main_~i~0 (* main_~k~0 2))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 16:25:48,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(< (+ main_~i~0 1) (* main_~k~0 2))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {278#(< main_~i~0 (* main_~k~0 2))} is VALID [2022-04-27 16:25:48,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(< (+ main_~i~0 1) (* main_~k~0 2))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {282#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 16:25:48,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {282#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 16:25:48,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {289#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:48,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {208#true} is VALID [2022-04-27 16:25:48,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 16:25:48,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 16:25:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:48,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589351942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:25:48,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:25:48,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2022-04-27 16:25:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221721214] [2022-04-27 16:25:48,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:25:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:25:48,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:48,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 16:25:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 16:25:48,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:25:48,472 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:48,739 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 16:25:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 16:25:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:25:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-27 16:25:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-27 16:25:48,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-27 16:25:48,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:48,780 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:25:48,780 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 16:25:48,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-04-27 16:25:48,781 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:48,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 34 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:25:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 16:25:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-04-27 16:25:48,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:48,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,783 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,783 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:48,784 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 16:25:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 16:25:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:48,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 16:25:48,785 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 16:25:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:48,786 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 16:25:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 16:25:48,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:48,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:48,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:48,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-27 16:25:48,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-27 16:25:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:48,788 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-27 16:25:48,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 16:25:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 16:25:48,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:48,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:48,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:25:49,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:49,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 600163970, now seen corresponding path program 1 times [2022-04-27 16:25:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:49,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090318596] [2022-04-27 16:25:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:49,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {430#true} is VALID [2022-04-27 16:25:49,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {430#true} {430#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:49,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {430#true} is VALID [2022-04-27 16:25:49,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {435#(= main_~n~0 0)} is VALID [2022-04-27 16:25:49,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {436#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:49,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {436#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:49,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {437#(and (= main_~i~0 0) (or (<= 1 main_~n~0) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 1)))} is VALID [2022-04-27 16:25:49,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(and (= main_~i~0 0) (or (<= 1 main_~n~0) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 1)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {438#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 16:25:49,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {439#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 16:25:49,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {439#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 16:25:49,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {440#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-27 16:25:49,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {440#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {441#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-27 16:25:49,222 INFO L272 TraceCheckUtils]: 14: Hoare triple {441#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {442#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:25:49,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {442#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {443#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:25:49,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {443#(not (= __VERIFIER_assert_~cond 0))} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-27 16:25:49,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-27 16:25:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090318596] [2022-04-27 16:25:49,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090318596] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:25:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608560743] [2022-04-27 16:25:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:49,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:49,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:25:49,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:25:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:49,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 16:25:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:49,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:49,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {430#true} is VALID [2022-04-27 16:25:49,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {435#(= main_~n~0 0)} is VALID [2022-04-27 16:25:49,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {436#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:49,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {436#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:49,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {472#(and (= main_~n~0 1) (= main_~i~0 0))} is VALID [2022-04-27 16:25:49,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(and (= main_~n~0 1) (= main_~i~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {476#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 16:25:49,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {480#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-27 16:25:49,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {480#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-27 16:25:49,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {480#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {487#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= main_~i~0 2))} is VALID [2022-04-27 16:25:49,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {487#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= main_~i~0 2))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {491#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= (* main_~k~0 2) 2))} is VALID [2022-04-27 16:25:49,574 INFO L272 TraceCheckUtils]: 14: Hoare triple {491#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= (* main_~k~0 2) 2))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:49,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:49,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {499#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-27 16:25:49,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-27 16:25:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:49,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:25:49,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-27 16:25:49,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {499#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {431#false} is VALID [2022-04-27 16:25:49,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:49,964 INFO L272 TraceCheckUtils]: 14: Hoare triple {515#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:49,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {515#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 16:25:49,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {523#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {519#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-27 16:25:49,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {523#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {523#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 16:25:49,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {523#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 16:25:49,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {530#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} is VALID [2022-04-27 16:25:49,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {534#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} is VALID [2022-04-27 16:25:49,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {538#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:49,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {538#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:49,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {435#(= main_~n~0 0)} is VALID [2022-04-27 16:25:49,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {430#true} is VALID [2022-04-27 16:25:49,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {430#true} is VALID [2022-04-27 16:25:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:49,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608560743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:25:49,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:25:49,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-04-27 16:25:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409982452] [2022-04-27 16:25:49,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:25:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 16:25:49,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:49,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:50,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 16:25:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 16:25:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-27 16:25:50,021 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:50,951 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 16:25:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 16:25:50,951 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 16:25:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 44 transitions. [2022-04-27 16:25:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 44 transitions. [2022-04-27 16:25:50,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 44 transitions. [2022-04-27 16:25:50,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:50,999 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:25:50,999 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 16:25:51,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 16:25:51,001 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:51,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 62 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:25:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 16:25:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-27 16:25:51,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:51,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:51,004 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:51,004 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:51,006 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 16:25:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 16:25:51,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:51,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:51,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 16:25:51,006 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 16:25:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:51,007 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 16:25:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 16:25:51,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:51,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:51,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:51,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-27 16:25:51,009 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2022-04-27 16:25:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:51,009 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-27 16:25:51,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 16:25:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 16:25:51,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:51,010 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:51,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:25:51,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:25:51,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 249106799, now seen corresponding path program 2 times [2022-04-27 16:25:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:51,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17380157] [2022-04-27 16:25:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:51,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {732#true} is VALID [2022-04-27 16:25:51,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {732#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:51,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {732#true} is VALID [2022-04-27 16:25:51,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {732#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {732#true} {732#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {732#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {732#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {737#(= main_~n~0 0)} is VALID [2022-04-27 16:25:51,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {737#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {738#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:51,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {738#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:51,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {738#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {739#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {741#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 16:25:51,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {741#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {741#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 16:25:51,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {742#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {742#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {740#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {743#(and (or (<= (+ main_~i~0 3) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= (* main_~n~0 2) (+ main_~i~0 3))))} is VALID [2022-04-27 16:25:51,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {743#(and (or (<= (+ main_~i~0 3) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= (* main_~n~0 2) (+ main_~i~0 3))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {744#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)))} is VALID [2022-04-27 16:25:51,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {745#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {745#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {745#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {745#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {746#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:51,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {746#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,439 INFO L272 TraceCheckUtils]: 23: Hoare triple {733#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {733#false} is VALID [2022-04-27 16:25:51,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {733#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {733#false} is VALID [2022-04-27 16:25:51,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {733#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {733#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 16:25:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17380157] [2022-04-27 16:25:51,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17380157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:25:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764496756] [2022-04-27 16:25:51,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:25:51,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:51,441 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 16:25:51,442 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 16:25:51,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:25:51,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:25:51,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 16:25:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:51,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:51,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {732#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {732#true} is VALID [2022-04-27 16:25:51,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {732#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {732#true} {732#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {732#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {732#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {737#(= main_~n~0 0)} is VALID [2022-04-27 16:25:51,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {737#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {738#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:51,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {738#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:51,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {738#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {739#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {778#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {778#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {778#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {788#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {788#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:51,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {795#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2))} is VALID [2022-04-27 16:25:51,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {795#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {799#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-27 16:25:51,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {799#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {799#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-27 16:25:51,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {799#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {806#(= main_~i~0 3)} is VALID [2022-04-27 16:25:51,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#(= main_~i~0 3)} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {810#(= main_~i~0 4)} is VALID [2022-04-27 16:25:51,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {810#(= main_~i~0 4)} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {814#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} is VALID [2022-04-27 16:25:51,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {814#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {814#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} is VALID [2022-04-27 16:25:51,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {814#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {821#(and (< 4 (* main_~k~0 2)) (<= main_~i~0 5))} is VALID [2022-04-27 16:25:51,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {821#(and (< 4 (* main_~k~0 2)) (<= main_~i~0 5))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,752 INFO L272 TraceCheckUtils]: 23: Hoare triple {733#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {733#false} is VALID [2022-04-27 16:25:51,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {733#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {733#false} is VALID [2022-04-27 16:25:51,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {733#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {733#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:51,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:25:51,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {733#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {733#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {733#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {733#false} is VALID [2022-04-27 16:25:51,960 INFO L272 TraceCheckUtils]: 23: Hoare triple {733#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {733#false} is VALID [2022-04-27 16:25:51,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {849#(< main_~i~0 (* main_~k~0 2))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {733#false} is VALID [2022-04-27 16:25:51,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {853#(< (+ main_~i~0 1) (* main_~k~0 2))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {849#(< main_~i~0 (* main_~k~0 2))} is VALID [2022-04-27 16:25:51,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {853#(< (+ main_~i~0 1) (* main_~k~0 2))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {853#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 16:25:51,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {853#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 16:25:51,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 16:25:51,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 16:25:51,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 16:25:51,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 16:25:51,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 16:25:51,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {864#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 16:25:51,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {732#true} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {860#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 16:25:51,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {732#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {732#true} is VALID [2022-04-27 16:25:51,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {732#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {732#true} {732#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {732#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {732#true} is VALID [2022-04-27 16:25:51,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {732#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {732#true} is VALID [2022-04-27 16:25:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 16:25:51,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764496756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:25:51,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:25:51,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 6] total 25 [2022-04-27 16:25:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749571854] [2022-04-27 16:25:51,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:25:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:25:51,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:51,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:52,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 16:25:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 16:25:52,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-04-27 16:25:52,019 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:52,886 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-27 16:25:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 16:25:52,886 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:25:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 42 transitions. [2022-04-27 16:25:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 42 transitions. [2022-04-27 16:25:52,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 42 transitions. [2022-04-27 16:25:52,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:52,935 INFO L225 Difference]: With dead ends: 36 [2022-04-27 16:25:52,935 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 16:25:52,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 16:25:52,937 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:52,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:25:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 16:25:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-04-27 16:25:52,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:52,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,939 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,939 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:52,940 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-27 16:25:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-27 16:25:52,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:52,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:52,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 16:25:52,941 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 16:25:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:52,942 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-27 16:25:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-27 16:25:52,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:52,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:52,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:52,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 16:25:52,944 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-04-27 16:25:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:52,944 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 16:25:52,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 16:25:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 16:25:52,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:52,945 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:52,963 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 16:25:53,163 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 16:25:53,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1415796412, now seen corresponding path program 3 times [2022-04-27 16:25:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:53,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626155914] [2022-04-27 16:25:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:25:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:53,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {1111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1093#true} is VALID [2022-04-27 16:25:53,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:53,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1093#true} {1093#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:53,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:25:53,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {1111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1093#true} is VALID [2022-04-27 16:25:53,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:53,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:53,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:53,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {1098#(= main_~n~0 0)} is VALID [2022-04-27 16:25:53,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {1099#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:53,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1099#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:53,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1100#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:53,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {1100#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 16:25:53,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 16:25:53,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1103#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {1103#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 16:25:53,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {1101#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 16:25:53,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 16:25:53,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1104#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-27 16:25:53,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {1104#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1105#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 16:25:53,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {1105#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1106#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 16:25:53,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {1106#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1106#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 16:25:53,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {1106#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1107#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-27 16:25:53,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {1107#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {1108#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-27 16:25:53,453 INFO L272 TraceCheckUtils]: 26: Hoare triple {1108#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1109#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:25:53,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1110#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:25:53,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {1110#(not (= __VERIFIER_assert_~cond 0))} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-27 16:25:53,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {1094#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-27 16:25:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 16:25:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626155914] [2022-04-27 16:25:53,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626155914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:25:53,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257859103] [2022-04-27 16:25:53,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 16:25:53,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:53,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:53,456 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 16:25:53,457 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 16:25:53,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 16:25:53,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:25:53,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 16:25:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:53,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:54,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:54,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1093#true} is VALID [2022-04-27 16:25:54,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:54,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:54,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:54,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {1098#(= main_~n~0 0)} is VALID [2022-04-27 16:25:54,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {1099#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:54,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1099#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:25:54,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1100#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:54,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {1100#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1142#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:54,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {1142#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1142#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:54,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {1142#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1142#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:54,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1152#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:54,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1152#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} is VALID [2022-04-27 16:25:54,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1159#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-27 16:25:54,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {1159#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ (- 1) main_~i~0) 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1163#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} is VALID [2022-04-27 16:25:54,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {1163#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1163#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} is VALID [2022-04-27 16:25:54,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {1163#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1163#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} is VALID [2022-04-27 16:25:54,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {1163#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1173#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-27 16:25:54,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {1173#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1173#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-27 16:25:54,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1180#(and (<= 3 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (<= main_~n~0 3))} is VALID [2022-04-27 16:25:54,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {1180#(and (<= 3 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (<= main_~n~0 3))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1184#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-27 16:25:54,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {1184#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= (+ main_~i~0 (- 4)) 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1188#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-27 16:25:54,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {1188#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1188#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-27 16:25:54,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1195#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= main_~i~0 6) (<= main_~n~0 3))} is VALID [2022-04-27 16:25:54,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {1195#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= main_~i~0 6) (<= main_~n~0 3))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {1199#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= (* main_~k~0 2) 6) (<= main_~n~0 3))} is VALID [2022-04-27 16:25:54,091 INFO L272 TraceCheckUtils]: 26: Hoare triple {1199#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= (* main_~k~0 2) 6) (<= main_~n~0 3))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:54,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:54,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-27 16:25:54,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {1094#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-27 16:25:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:54,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:25:55,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {1094#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-27 16:25:55,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-27 16:25:55,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:25:55,015 INFO L272 TraceCheckUtils]: 26: Hoare triple {1223#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:25:55,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {1227#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {1223#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 16:25:55,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {1231#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1227#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-27 16:25:55,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1231#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 16:25:55,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {1238#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1231#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 16:25:55,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {1242#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1238#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} is VALID [2022-04-27 16:25:55,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {1246#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1242#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} is VALID [2022-04-27 16:25:55,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {1246#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1246#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:55,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {1253#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1246#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:55,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {1253#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1253#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:55,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {1253#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1253#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:55,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1263#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1253#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 16:25:55,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {1267#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1263#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))))} is VALID [2022-04-27 16:25:55,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {1267#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1267#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-27 16:25:55,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {1274#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1267#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-27 16:25:55,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1274#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-27 16:25:55,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1274#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-27 16:25:55,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {1284#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 3))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1274#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-27 16:25:55,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1284#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-27 16:25:55,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1288#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1288#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} is VALID [2022-04-27 16:25:55,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {1288#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} is VALID [2022-04-27 16:25:55,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {1098#(= main_~n~0 0)} is VALID [2022-04-27 16:25:55,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:55,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:55,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:55,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1093#true} is VALID [2022-04-27 16:25:55,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-27 16:25:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:55,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257859103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:25:55,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:25:55,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 40 [2022-04-27 16:25:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9728822] [2022-04-27 16:25:55,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:25:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 16:25:55,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:55,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:55,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:55,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 16:25:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:55,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 16:25:55,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 16:25:55,088 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:56,124 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-27 16:25:56,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 16:25:56,124 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 16:25:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-27 16:25:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-27 16:25:56,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-27 16:25:56,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:56,158 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:25:56,158 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:25:56,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=579, Invalid=3203, Unknown=0, NotChecked=0, Total=3782 [2022-04-27 16:25:56,159 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:56,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 100 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:25:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:25:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:25:56,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:56,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:25:56,160 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:25:56,160 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:25:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:56,160 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:25:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:25:56,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:56,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:56,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:25:56,161 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:25:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:56,161 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:25:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:25:56,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:56,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:56,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:56,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:25:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:25:56,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-27 16:25:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:56,161 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:25:56,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:25:56,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:56,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:25:56,180 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 16:25:56,379 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 16:25:56,381 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-04-27 16:25:56,383 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:25:56,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:25:56 BasicIcfg [2022-04-27 16:25:56,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:25:56,385 INFO L158 Benchmark]: Toolchain (without parser) took 9750.09ms. Allocated memory was 187.7MB in the beginning and 270.5MB in the end (delta: 82.8MB). Free memory was 139.7MB in the beginning and 173.5MB in the end (delta: -33.8MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2022-04-27 16:25:56,385 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:25:56,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.13ms. Allocated memory is still 187.7MB. Free memory was 139.4MB in the beginning and 165.7MB in the end (delta: -26.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-27 16:25:56,386 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 187.7MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:25:56,386 INFO L158 Benchmark]: RCFGBuilder took 245.92ms. Allocated memory is still 187.7MB. Free memory was 164.1MB in the beginning and 152.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 16:25:56,386 INFO L158 Benchmark]: IcfgTransformer took 19.71ms. Allocated memory is still 187.7MB. Free memory was 152.1MB in the beginning and 151.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:25:56,386 INFO L158 Benchmark]: TraceAbstraction took 9276.10ms. Allocated memory was 187.7MB in the beginning and 270.5MB in the end (delta: 82.8MB). Free memory was 150.5MB in the beginning and 173.5MB in the end (delta: -23.0MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. [2022-04-27 16:25:56,388 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.13ms. Allocated memory is still 187.7MB. Free memory was 139.4MB in the beginning and 165.7MB in the end (delta: -26.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 187.7MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 245.92ms. Allocated memory is still 187.7MB. Free memory was 164.1MB in the beginning and 152.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.71ms. Allocated memory is still 187.7MB. Free memory was 152.1MB in the beginning and 151.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9276.10ms. Allocated memory was 187.7MB in the beginning and 270.5MB in the end (delta: 82.8MB). Free memory was 150.5MB in the beginning and 173.5MB in the end (delta: -23.0MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1029 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 75 mSDtfsCounter, 1029 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 138 SyntacticMatches, 9 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 3240 SizeOfPredicates, 14 NumberOfNonLiveVariables, 308 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 15/276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:25:56,419 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...